Limits of ML-definability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1140, Issue , 1996, Pages 17-31

  Kahrs, Stefan ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Completeness; Definability; ML; Polymorphism; Recursion

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; POLYMORPHISM;

COMPLETENESS; DEFINABILITY; RECURSIONS; TYPE SYSTEMS;

COMPUTATIONAL LINGUISTICS;

EID: 84957650552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61756-6_74     Document Type: Conference Paper

References (7)

1. F. Cardone and M. Coppo. Two extensions of Curry's type inference system. In P. Odifreddi, editor, Logic and Computer Science, pages 19-76. Academic Press, 1990.
2. N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation. Indagationes Mathematicae, 34:381-392, 1972.
3. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Jan vein Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 244-320. Elsevier, 1990.
4. Fritz Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253-289, 1993.
5. Stefan Kahrs. About the completeness of type systems. In Proceedings ESSLLI Workshop on Observational Equivalence and Logical Equivalence, 1996. (to appear).
6. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990.
7. Mads Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, University of Edinburgh, 1988. CST-52-88.