Retracts in simple types

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

Volumn 2044 LNCS, Issue , 2001, Pages 376-384

  Padovani, Vincent ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTABILITY AND DECIDABILITY; DIFFERENTIATION (CALCULUS); PATHOLOGY; BIOMINERALIZATION;

MINIMAL MODEL; SIMPLE TYPES; SIMPLY TYPED LAMBDA CALCULUS; TYPE SYSTEMS;

BIOMINERALIZATION; CALCULATIONS;

EID: 33750711588     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45413-6_29     Document Type: Conference Paper

References (6)

1. Bruce, K., Longo, G. (1985) Provable isomorphims and domain equations in models of typed languages. A.C.M. Symposium on Theory of Computing (STOC 85).
2. Dezani-Ciancaglini, M. (1976) Characterization of normal forms possessing inverse in the λβη-calculus. TCS 2.
3. de'Liguoro, U., Piperno, A., Statman, R. (1992) Retracts in simply typed λβη-calculus. Proceeding of the 7th annual IEEE symposium on Logic in Computer Science (LICS92), IEEE Computer Society Press.
4. Loader, R. (1997) An Algorithm for the Minimal Model. Manuscript. Available at http://www.dcs.ed.ac.uk/home/loader/.
5. Padovani, V. (1995) Decidability of all minimal models. Proceedings of the annual meeting Types for Proof and Programs - Torino 1995, Lecture Notes in Computer Science 1158, Springer-Verlag.
6. Schmidt-Schauß, M. (1998) Decidability of Behavioral Equivalence in Unary PCF. Theorical Computer Science 216.