A Curry-Howard foundation for functional computation with control (1997)

Cached

Download Links

by C. -h. L. Ong , C. A. Stewart
Venue:In Proceedings of ACM SIGPLAN-SIGACT Symposium on Principle of Programming Languages
Citations:77 - 3 self

Active Bibliography

30 A semantic view of classical proofs -- type-theoretic, categorical, and denotational characterizations (Extended Abstract) – C.-H. L. Ong - 1996
102 A New Deconstructive Logic: Linear Logic – Vincent Danos, Jean-Baptiste Joinet, Harold Schellinx - 1995
3 A program logic for higher-order procedural variables . . . . – T. Crolard, et al. - 2009
Première partie – unknown authors
Niels Jakob Rehof Morten Heine Srensen – Diku Department Of, Niels Jakob Rehof, Morten Heine Srensen - 1994
23 A formulae-as-types interpretation of subtractive logic – Tristan Crolard - 2004
15 A CPS-Translation of the λµ-Calculus – Philippe de Groote - 1994
15 The Formal Relationship Between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms – Amr A. Sabry - 1994
1 Classical Proofs as Programs, Cut Elimination as Computation – Ichiro Ogata - 1998
Gentzen-Style Classical Proofs as λµ-Terms – Ichiro Ogata - 1999
4 Cut Elimination for Classical Proofs as Continuation Passing Style Computation – Ichiro Ogata - 1998
32 A Semantic analysis of control – James David Laird - 1998
1 Typing Streams in the Λµ-calculus – Alexis Saurin - 2009
Type Theory for Programming Languages – Robert Harper - 1994
unknown title – René David, Karim Nour - 905
unknown title – René David, Karim Nour - 905
Author manuscript, published in "Typed Lambda Calculi and Applications, Nara: Japan (2005)" Arithmetical proofs of strong normalization results for the symmetric λµ-calculus – René David, Karim Nour - 2009
CLA 2004 Preliminary Version Why the usual candidates of reducibility do not work for the symmetric λµ-calculus – René David, Karim Nour - 2009
17 Arithmetical proofs of strong normalization results for symmetric λ-calculi – René David, Karim Nour