Galois embedding from polymorphic types into existential types

Lecture Notes in Computer Science

Volumn 3461, Issue , 2005, Pages 194-208

  Fujita, Ken Etsu ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE; DATA PROCESSING; EMBEDDED SYSTEMS; FORMAL LOGIC; FUNCTIONS; LOGIC PROGRAMMING;

BIJECTIVE TRANSLATIONS; GALOIS EMBEDDING; POLYMORPHIC FUNCTIONS; Λ-CALCULUS;

COMPUTATION THEORY;

EID: 24944519351     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417170_15     Document Type: Conference Paper

References (13)

1. [Coq86] Th. Coquand: An analysis of Girard's paradox, Proc. the Annual IEEE Symposium on Logic in Computer Science (1986) 227-236
2. [Fuji03] K. Fujita: A sound and complete CSP-translation for λμ-Calculus, Lecture Notes in Computer Science 2701 (2003) 120-134
3. [GTL89] J-Y. Girard, P. Taylor, and Y. Lafont: Proofs and Types, Cambridge University Press (1989)
4. [HS97] M. Hofmann and T. Streicher: Continuation models are universal for λμcalculus, Proc. the 12th Annual IEEE Symposium on Logic in Computer Science (1997) 387-395
5. [MP85] J. C. Mitchell and G. D. Plotkin: Abstract types have existential type, Proc. the 12th Annual ACM Symposium on Principles of Programming Languages (1985) 37-51
6. [Pari92] M. Parigot: λμ-Calculus: An Algorithmic Interpretation of Classical Natural Deduction, Lecture Notes in Computer Science 624 (1992) 190-201
7. [Plot75] G. Plotkin: Call-by-Name, Call-by-Value and the λ-Calculus, Theoretical Computer Science 1 (1975) 125-159
8. [Pra65] D. Prawitz: Natural Deduction, A Proof Theoretical Study, Almqvist & Wiksell, Stockholm (1965)
9. [Seli01] P. Selinger: Control Categories and Duality: on the Categorical Semantics of the Lambda-Mu Calculus, Math. Struct. in Compu. Science 11 (2001) 207260
10. [SF93] A. Sabry and M. Felleisen: Reasoning about Programs in ContinuationPassing Style, Lisp and Symbolic Computation: An International Journal 6 (1993) 289-360
11. [SW97] A. Sabry and Ph. Wadler: A reflection on call-by-value, ACM Transactions on Programming Languages and Systems 19-6 (1997) 916-941
12. [Thie04] H. Thielecke: Answer type polymorphism in call-by-name continuation passing, Lecture Notes in Computer Science 2986 (2004) 279-293
13. [Wad03] Ph. Wadler: Call-by-value is dual to call-by-name, International Conference on Functional Programming, August 25-29, Uppsala (2003)