Semantic types: A fresh look at the ideal model for types

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn 31, Issue , 2004, Pages 52-63

  Vouillon, Jérôme ^a   Melliès, Paul André ^a  

^a CNRS   (France)

Author keywords

Ideal model; Inductive coinductive principle; Polymorphism; Realizability; Recursive types; Subtyping

Indexed keywords

OPERATIONAL SEMANTICS; POLYMORPHISMS; PROGRAM CONSTRUCTS; RECURSIVE TYPES;

APPROXIMATION THEORY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; ERROR ANALYSIS; MATHEMATICAL MODELS; SET THEORY;

SEMANTICS;

EID: 2442466873     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (42)

1. M. Abadi, B. Pierce, and G. Plotkin. Faithful ideal models for recursive polymorphic types. International Journal of Foundations of Computer Science. 2(1):1-21, Mar. 1991. Summary in Fourth Annual Symposium on Logic in Computer Science, June, 1989.
2. M. Abadi and G. Plotkin. A per model of polymorphism and recursive types. In J. Mitchell, editor, 5th Annual IEEE Symposium on Logic in Computer Science, pages 355-365. IEEE Computer Society Press. 1990.
3. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Clarendon Press, 1994.
4. R. Amadio. Recursion over readability structures. Information and Computation, 91:55-85, 1991.
5. A. W. Appel and D. McAllester. An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems (TOPLAS), 23(5):657-683, 2001.
6. L. Birkedal and R. Harper. Constructing interpretations of recursives types in an operational setting. Information and Computation, 155:3-63, 1999.
7. G. Birkhoff. Lattice theory, volume 25 of Colloquium Publications. American Mathematical Society, 1940.
8. M. Brandt and F. Henglein. Coinductive axiomatization of recursive type equality and subtyping. In R. Hindley, editor, Proc. 3d Int'l Conf. on Typed Lambda Calculi and Applications (TLCA), Nancy, France, April 2-4, 1997, volume 1210 of Lecture Notes in Computer Science (LNCS), pages 63-81. Springer-Verlag, April 1997.
9. K. Bruce and J. Mitchell. PER models of subtyping, recursive types and higher-order polymorphism. In Proc. 19th ACM Symp. on Principles of Programming, pages 316-327, 1992.
10. F. Cardone. Relational semantics for recursive types and bounded quantification. In Proceedings of the Sixteenth International Colloquium on Automata, Languages, and Programming, volume 372 of Lecture Notes in Computer Science, pages 164-178, Stresa, Italy, July 1989. Springer-Verlag.
11. R. Cartwright. Types as intervals. In Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 22-36. ACM Press, 1985.
12. J. Chroboczek. Subtyping recursive games. In Proceedings of the Fifth International Conference on Typed Lambda Calculi and Applications (TLCA '01)., Kraków, Poland, May 2001.
13. L. Dami. Labelled reductions, runtime errors and operational subsumption. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, ICALP, volume 1256 of Lecture Notes in Computer Science, pages 782-793. Springer, 1997.
14. L. Dami. Operational subsumption, an ideal model of subtyping. In A. D. Gordon, A. M. Pitts, and C. Talcott, editors, HOOTS II Second Workshop on Higher-Order Operational Techniques in Semantics, volume 10 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2000.
15. F. Damm. Subtyping with union types, intersection types and recursive types II. Research Report 2259, INRIA Rennes, May 1994.
16. V. Danos and J.-L. Krivine. Disjunctive tautologies and synchronisation schemes. In Computer Science Logic'00, volume 1862 of Lecture Notes in Computer Science, pages 292-301. Springer, 2000.
17. R. Davies and F. Pfenning. Intersection types and computational effects. In ICFP '00 [29], pages 198-208.
18. M. Erné, J. Koslowski, A. Melton, and G. E. Strecker. A primer on Galois connections. In A. R. Todd, editor, Papers on general topology and applications (Madison, WI, 1991), volume 704 of Annals of the New York Academy of Sciences, pages 103-125, New York, 1993. New York Acad. Sci.
19. M. P. Fiore. A coinduction principle for recursive data types based on bisimulation. Information and Computation, 127(2): 186-198, 1996.
20. P. J. Freyd. Algebraically complete categories. In A. Carboni, M. C. Pedicchio, and G. Rosolini, editors, Proceedings of the 1990 Como Category Theory Conference, volume 1488 of Lecture Notes in Mathematics, pages 95-104. Springer-Verlag, 1991.
21. A. Frisch, G. Castagna, and V. Benzaken. Semantic subtyping. In 17th IEEE Symposium on Logic in Computer Science, pages 137-146. IEEE Computer Society Press, 2002.
22. V. Gapeyev, M. Levin, and B. Pierce. Recursive sub-typing revealed. In ICFP '00 [29]. To appear in Journal of Functional Programming.
23. J.-Y. Girard. Locus solum: From the rules of logic to the logic of rules. Mathematical Structures in Computer Science, 11(3):301-506, June 2001.
24. A. D. Gordon and A. M. Pitts, editors. Higher Order Operational Techniques in Semantics. Publications of the Newton Institute. Cambridge University Press, 1998.
25. J. Goubault-Larrecq, S. Lasota, and D. Nowak. Logical relations for monadic types. In Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic (CSL'02), volume 2471 of Lecture Notes in Computer Science, pages 553-568. Springer-Verlag, Sept. 2002.
26. H. Hosoya and B. C. Pierce. XDuce: A statically typed XML processing language. ACM Transactions on Internet Technology, 2002. Submitted for publication.
27. H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. ACM Transactions on Programming Languages and Systems (TOPLAS). To appear; short version in ICFP 2000.
28. J. M. E. Hyland. A syntactic characterization of the equality in some models of the λ-calculus. Journal of the London Mathematical Society, 12(2):361-370, 1976.
29. Proceedings of the the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP'00), Montréal, Canada, Sept. 2000. ACM Press.
30. J.-J. Lévy. An algebraic interpretation of the lambda beta K-calculus; and an application of a labelled lambda-calculus. Theoretical Computer Science, 2(1):97-114, June 1976.
31. D. MacQueen, G. Plotkin, and R. Sethi. An ideal model for recursive polymorphic types. Information and Control, 71(1-2):95-130, 1986.
32. I. A. Mason, S. F. Smith, and C. L. Talcott. From operational semantics to domain theory. Information and Computation, 128(1):26-47, 1996.
33. B. C. Pierce. Programming with intersection types, union types, and polymorphism. Technical Report CMU-CS-91-106, Carnegie Mellon University, Feb. 1991.
34. A. M. Pitts. Relational properties of domains. Information and Computation, 127:66-90, 1996.
35. A. M. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in computer Science, 10:321-359, 2000.
36. A. M. Pitts and I. D. B. Stark. Operational reasoning for functions with local state. In Gordon and Pitts [24], pages 227-273.
37. S. F. Smith. The coverage of operational semantics. In Gordon and Pitts [24], pages 307-346.
38. B. M. R. Stadler and P. F. Stadler. Basic properties of closure spaces, 2002. Supplemental material for [39].
39. B. M. R. Stadler and P. F. Stadler. Generalized topological spaces in evolutionary theory and combinatorial chemistry. J. Chem. Inf. Comput. Sci., 42:577-585, 2002. Proceedings MCC 2001, Dubrovnik.
40. I. Stark. Names, equations, relations: practical ways to reason about new. Fundamenta Informaticae, 33(4):369-396, 1998.
41. C. Talcott. Reasoning about functions with effects. In Gordon and Pitts [24], pages 347-390.
42. ∞-models of the lambda-calculus. SIAM Journal on Computing, 5(3):488-521, Sept. 1976.