|
28
|
A semantic view of classical proofs -- type-theoretic, categorical, and denotational characterizations (Extended Abstract)
– C.-H. L. Ong
- 1996
|
|
87
|
A New Deconstructive Logic: Linear Logic
– Vincent Danos, Jean-Baptiste Joinet, Harold Schellinx
- 1995
|
|
|
Première partie
– unknown authors
|
|
2
|
A program logic for higher-order procedural variables . . . .
– T. Crolard, et al.
- 2009
|
|
|
Niels Jakob Rehof Morten Heine Srensen
– Diku Department Of, Niels Jakob Rehof, Morten Heine Srensen
- 1994
|
|
15
|
A formulae-as-types interpretation of subtractive logic
– Tristan Crolard
- 2004
|
|
12
|
A CPS-Translation of the λµ-Calculus
– Philippe de Groote
- 1994
|
|
13
|
The Formal Relationship Between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms
– Amr A. Sabry
- 1994
|
|
4
|
Cut Elimination for Classical Proofs as Continuation Passing Style Computation
– Ichiro Ogata
- 1998
|
|
1
|
Classical Proofs as Programs, Cut Elimination as Computation
– Ichiro Ogata
- 1998
|
|
|
Gentzen-Style Classical Proofs as λµ-Terms
– Ichiro Ogata
- 1999
|
|
31
|
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
|
|
11
|
Arithmetical proofs of strong normalization results for symmetric λ-calculi
– René David, Karim Nour
|
|
|
unknown title
– René David, Karim Nour
- 905
|
|
|
unknown title
– René David, Karim Nour
- 905
|
|
|
work for the
– René David, Karim Nour
|
|
8
|
Search algorithms in type theory
– James L. Caldwell, Ian P. Gent, Judith Underwood
- 2000
|
