Construção de Domínios Bi-Scott via Completação por Ideais
Resumo
Texto completo:
PDFReferências
[1] B.M. Acióly, “Fundamentação Computacional da Matemática Intervalar”, Tese de doutorado, CPGCC da UFRGS, Porto Alegre, 1991.
B.R.C. Bedregal, “Sistemas de Informa¸c˜ao Cont´ınuos: Uma Abordagem L´ogica e Computacional para a Matem´atica Intervalar”, Tese de doutorado, DI-UFPE, Recife, 1996.
R. Boche, “Complex Interval Arithmetic whit Some Applications”, Lockheed Missiles and Space Company, Technical Report LMSC4-22-66-1, Palo Alto, CA, 1965.
R. Callejas-Bedregal, B.R.C. Bedregal, Interval as a Domain Constructor, em “Seleta do XXIII CNMAC” (E.X.L. de Andrade et al., eds.), Tendências em Matemática Aplicada e Computacional, Vol. 2, pp. 43-52, SBMAC, 2001.
G. Gierz, K.H. Hofmann, K. Keimel, M. Mislove, D.S. Scott, “A Compendium of Continuous Lattices”, Springer-Verlag, 1980.
C.A. Gunter, Comparing categories of domains, in LNCS, Vol. 239, pp. 101-121, Springer-Verlag, 1985.
C.A. Gunter, “Semantics of Programming Languages: Structures and Techniques”, MIT Press, 1992.
L. Jaulin, M. Kieffer, O. Didrit, E. Walter, “Applied Interval Analysis”, Springer-Verlag, London, 2001.
J.D. Lawson, The versatile of continuous order, in LNCS, Vol. 298, Springer-Verlag, 1987.
R.E. Moore, “Automatic error analysis in digital computation”, Lockheed Missiles and Space Co. Technical Report LMSD-48421, Palo Alto, CA, 1959.
R.E. Moore, “Interval Analysis”, Pretince Hall, New Jersey, 1966.
R.E. Moore, “Methods and Applications for Interval Analysis”, Philadelphia, SIAM, 1979.
G. Markowsky, B.K. Rosen, Bases for Chain-Complete Posets, IBM Journal of Research and Development, 20 (1976), 138-147.
G. Plotkin, “Domains”, Department of Computer Science, University of Edinburgh, 1983.
R.H.N. Santiago, B.R.C. Bedregal, B.M. Aci´oly, Interval Representations, em “Seleta do XXVI CNMAC” (E.X.L. de Andrade et al., eds.), TEMA - Tendências em Matemática Aplicada e Computacional, Vol. 5, No. 2, pp. 317- 326, SBMAC, 2004.
D.S. Scott, Outline of a Mathematical Theory of Computation, in 4th Annual Princeton Conference on Information Sciences and Systems, pp. 169-176, 1970.
A. Stoltenberg-Hansen, I. Lindstr¨om, E.B. Griffor, “Mathematical Theory of Domains”, Cambridge Tracts in Theoretical Computer Science 22, Cambridge university Press, 1994.
M. Smyth, Effectively given domains. Theoretical Computer Science, 5 (1977), 257-274.
K. Weihrauch, “Computable Analysis”, Springer, Berlin, 2000.
DOI: https://doi.org/10.5540/tema.2007.08.03.0341
Métricas do artigo
Metrics powered by PLOS ALM
Apontamentos
- Não há apontamentos.
Trends in Computational and Applied Mathematics
A publication of the Brazilian Society of Applied and Computational Mathematics (SBMAC)
Indexed in: