CPS translating inductive and coinductive types

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 2002, Pages 131-142

  Barthe, Gilles ^a   Uustalu, Tarmo ^a  

^a INRIA   (France)

Author keywords

Classical logic and control; CPS translations; Dependent types; Inductive and coinductive types; Typed calculi

Indexed keywords

MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROGRAM TRANSLATORS; TRANSLATION (LANGUAGES);

CLASSICAL LOGIC AND CONTROL; CONTINUATION PASSING STYLE;

MATHEMATICAL PROGRAMMING;

EID: 0036041754     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/503032.503043     Document Type: Conference Paper

References (47)

1. Representations of first order function types as terminal coalgebras
2. A symmetric lambda calculus for classical program extraction
3. Lambda calculi with types
4. A notion of classical pure type system (preliminary version)
5. Reflections on reflections
6. CPS-translations and applications: The cube and beyond
7. Domain-free pure type systems
8. A realization of the negative interpretation of the axiom of choice
9. A constructive interpretation of positive inductive definitions
10. Program extraction from classical proofs
11. Finding computational content in classical proofs
12. Metamathematical investigations of a calculus of constructions
13. Inductively defined types (preliminary version)
14. Continuations in programming practice: Introduction and survey
15. Inductive and coinductive types with iteration and recursion
16. Inconsistency of classical logic in type theory
17. Induction is not derivable in second order dependent type theory
18. The formulae-as-types notion of control
19. A CPS-translation of the λμ-calculus
20. A simple calculus of exception handling
21. On the strong normalization of natural deduction with permutation- Conversions
22. Polymorphic type assignment and CPS conversion
23. Explicit polymorphism and CPS conversion
24. Contracting proofs to programs
25. Inductive types and type constraints in the second-order lambda-calculus
26. Continuation semantics in typed lambda-calculi (summary)
27. An evaluation semantics for classical proofs
28. A constructive logic behind the catch and throw mechanism
29. A semantic view of classical proofs: Type-theoretic, categorical, and denotational characterizations (preliminary extended abstract)
30. A Curry-Howard foundation for functional computation with control
31. λμ-calculus: An algorithmic interpretation of classical natural deduction
32. Classical proofs as programs
33. Inductive definitions in the system Coq: Rules and properties
34. Call-by-name, call-by-value and the λ-calculus
35. Δ calculus
36. A type system for certified binaries
37. Least and greatest fixed points in intuitionistic natural deduction
38. CPS transform and type derivations for dependent ML