|
3
|
Notions of computability at higher types III
– J R Longley
- 2001
|
|
4
|
Unifying typed and untyped realizability. Electronic note, available at http://www.dcs.ed.ac.uk/home/jrl/unifying.txt
– J R Longley
- 1999
|
|
17
|
Matching typed and untyped realizability
– J R Longley
- 1999
|
|
17
|
When is a Functional Program Not a Functional Program?
– John Longley
- 1999
|
|
55
|
Realizability Toposes and Language Semantics
– J Longley
- 1995
|
|
36
|
The sequentially realizable functionals
– John Longley
|
|
1
|
A Proof System for Correct Program Development
– M.P. Fourman, J. D. Fleuriot, J.R. Longley
- 2000
|
|
2
|
A universal realizability model for sequential computation
– A Rohr
- 2002
|
|
1
|
Constructive data refinement
– F Honsell, J Longley, D Sannella, A Tarlecki
- 2000
|
|
1
|
Operational semantics for algebraic e#ects
– G D Plotkin, A J Power
- 2001
|
|
2
|
Notions of computability at higher types. To be submitted to
– J R Longley
- 2000
|
|
2
|
On the computational complexity of Longley's H functional
– James S. Royer
- 2000
|
|
8
|
Impredicativity entails Untypedness
– Peter Lietz, Thomas Streicher
- 2000
|
|
9
|
Semantics for Algebraic Operations
– Gordon Plotkin, John Power
- 2001
|
|
7
|
Set Theoretic Problems Suggested by the Notion of Potential Totality
– G Kreisel
- 1959
|
|
7
|
Computable functionals of finite type I
– R O Gandy
- 1967
|
|
5
|
Another approach to sequentiality: Kleene’s unimonotone functions
– A Bucciarelli
- 1993
|
|
12
|
Continuous Functionals of Dependent Types and Equilogical Spaces
– Andrej Bauer, Lars Birkedal
- 2000
|
|
6
|
Total objects in inductively defined types
– L Kristiansen, D Normann
- 1997
|
