|
|
On Completability of Partial
– Andrea Asperti, Agata Ciabattoni
|
|
19
|
Computational Foundations of Basic Recursive Function Theory
– Robert L. Constable, Scott Fraser Smith
- 1988
|
|
1
|
Introduction to Turing categories
– J. R. B. Cockett, Pieter J. W. Hofstra
|
|
1
|
Extending Partial Combinatory Algebras
– Inge Bethke, Jan Willem Klop, Roel de Vrijer
- 1999
|
|
12
|
Collapsing Partial Combinatory Algebras
– Inge Bethke, Jan Willem Klop
- 1996
|
|
3
|
Completing Partial Combinatory Algebras with Unique Head-Normal Forms
– Inge Bethke, Jan Willem Klop, Roel De Vrijer
- 1996
|
|
10
|
Notions of computability at higher types I
– John Longley
- 2005
|
|
5
|
A Limiting First Order Realizability Interpretation
– Masahiro Nakata, Susumu Hayashi
|
|
|
I Basic Categories 6
– J. R. B. Cockett
- 2010
|
|
|
Handbook of the History of Logic. Volume 6
– Andrea Cantini, Dov M. Gabbay, John Woods (editors
|
|
6
|
Typed static analysis: Application to groundness analysis of Prolog and lambda-Prolog
– Olivier Ridoux, Patrice Boizumault
- 1999
|
|
4
|
On Introducing Higher Order Functions in ABEL
– Bjørn Kristoffersen, Ole-Johan Dahl
- 1998
|
|
1
|
Foundations of Functional Programming
– Lawrence C. Paulson
- 2000
|
|
6
|
A functional shell that dynamically combines compiled code
– Arjen Van Weelden, Rinus Plasmeijer
- 2003
|
|
8
|
A Complete Characterization of Complete Intersection-Type Theories (Extended Abstract)
– M. Dezani-ciancaglini, F. Honsell, F. Alessi
- 2000
|
|
49
|
Five axioms of alpha-conversion
– Andrew D. Gordon, Tom Melham
- 1996
|
|
4
|
On the Correspondence Between Proofs and λ-Terms
– Jean Gallier
- 1995
|
|
11
|
Termination and confluence of higher-order rewrite systems
– Frédéric Blanqui
- 2000
|
|
27
|
Bi-rewrite systems
– Jordi Levy, Jaume Agusti
- 1996
|
