|
|
Least and Greatest Fixed Points in Intuitionistic Natural Deduction
– Tarmo Uustalu, Varmo Vene
- 2002
|
|
39
|
Monads and Effects
– Nick Benton, John Hughes, Eugenio Moggi
- 2000
|
|
1
|
On the Logical Content of Computational Type Theory: A Solution to Curry's Problem
– Matt Fairtlough, Michael Mendler
- 2002
|
|
75
|
The Marriage of Effects and Monads
– Philip Wadler, Peter Thiemann
- 1998
|
|
21
|
Thunks and the λ-calculus
– John Hatcliff, Olivier Danvy
- 1997
|
|
25
|
Termination Checking with Types
– Andreas Abel
- 1999
|
|
30
|
Type-Based Termination of Recursive Definitions
– G. Barthe, M. J. Frade, E. Giménez, L. Pinto, T. Uustalu
- 2002
|
|
1
|
The Recursion Scheme from the Cofree Recursive Comonad
– Tarmo Uustalu, Varmo Vene
|
|
9
|
Reducibility and ⊤⊤-lifting for computation types
– Sam Lindley, Ian Stark
- 2005
|
|
1
|
Cover semantics for quantified lax logic
– Robert Goldblatt
|
|
19
|
A Modal Deconstruction of Access Control Logics
– Deepak Garg, Martín Abadi
|
|
3
|
Characterising Combinational Timing Analyses in Intuitionistic Modal Logic
– M. Mendler
- 2000
|
|
|
Première partie
– unknown authors
|
|
2
|
A program logic for higher-order procedural variables . . . .
– T. Crolard, et al.
- 2009
|
|
|
A Modal Language for Effects
– Sungwoo Park, Robert Harper
- 2004
|
|
1
|
A Programming Language for Probabilistic Computation
– Sungwoo Park, Geoffrey Gordon, Robert Harper
- 2005
|
|
|
A Logical View of Effects
– Sungwoo Park , Robert Harper
|
|
11
|
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
– Dariusz Biernacki, Olivier Danvy, Kevin Millikin
- 2006
|
|
4
|
A Computational Formalization for Partial Evaluation (Extended Version)
– John Hatcliff, Olivier Danvy
- 1996
|
