Types for hereditary permutators

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 83-92

  Tatsuta, Makoto ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTERS; DIFFERENTIATION (CALCULUS);

INFINITE PATH; LOGIC IN COMPUTER SCIENCE; TYPE SYSTEMS;

RECURSIVE FUNCTIONS;

EID: 51549099441     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.18     Document Type: Conference Paper

References (9)

1. A. Berarducci, M. Dezani-Ciancaglini, Infinite lambda-calculus and Types, Theoretical Computer Science 212 (1999) 29-75.
2. J.A. Bergstra and J.W. Klop, Invertible terms in the lambda calculus, Theoretical Computer Science 11 (1980) 19-37.
3. K. Bruce, R. Di Cosmo, and G. Longo, Provable isomorphisms of types, Mathematical Structures in Computer Science 2 (2) (1992) 231-247.
4. M. Dezani-Ciancaglini, Characterization of normal forms possessing inverse in the lambda-beta-eta-calculus, Theoretical Computer Science 2 (1976) 323-337.
5. M. Dezani-Ciancaglini, F. Honsell, and Y. Motohama, Compositional Characterization of λ-terms using Intersection Types, Theoretical Computer Science 340 (3) (2005) 459-495.
6. R. Hasegawa, L. Paolini, and P. Urzy-czyn, The TLCA list of Open Problems, http://tlca.di.unito.it/opltlca/, 2007.
7. J.R. Hindley and J.P. Seldin, Introduction to Combi-nators and λ-Calculus (Cambridge University Press, Cambridge, 1986).
8. J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J de Vries, Infinitary lambda calculus, Theoretical Computer Science 175 (1) (1997) 93-125.
9. M. Tatsuta and M. Dezani-Ciancaglini, Normalisation is Insensible to lambda-term Identity or Difference, In: Proceedings of Twenty First Annual IEEE Symposium on Logic in Computer Science (2006) 327-336.