Effective Applicative Structures (1995)

Cached

Download Links

by Andrea Asperti , Agata Ciabattoni , Piazza Porta , S. Donato
Venue:In: Proceedings of the 6th biennial conference on Category Theory in Computer Science (CTCS'95). Springer-Verlag Lecture Notes in Computer Science 953 81--95
Citations:7 - 2 self

Active Bibliography

On Completability of Partial – Andrea Asperti, Agata Ciabattoni
20 Computational Foundations of Basic Recursive Function Theory – Robert L. Constable, Scott Fraser Smith - 1988
4 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
12 Notions of computability at higher types I – John Longley - 2005
5 A Limiting First Order Realizability Interpretation – Masahiro Nakata, Susumu Hayashi
3 Towards Limit Computable Mathematics – Susumu Hayashi, Masahiro Nakata
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
4 On Introducing Higher Order Functions in ABEL – Bjørn Kristoffersen, Ole-Johan Dahl - 1998
6 A functional shell that dynamically combines compiled code – Arjen Van Weelden, Rinus Plasmeijer - 2003
6 On the Correspondence Between Proofs and λ-Terms – Jean Gallier - 1995
78 Higher-order narrowing with definitional trees – Michael Hanus, Christian Prehofer - 1996
6 Typed static analysis: Application to groundness analysis of Prolog and lambda-Prolog – Olivier Ridoux, Patrice Boizumault - 1999
29 Bi-rewrite systems – Jordi Levy, Jaume Agusti - 1996
109 Ellipsis and higher-order unification – Mary Dalrymple, Stuart M. Shieber, Fernando C. N. Pereira - 1991
51 Five axioms of alpha-conversion – Andrew D. Gordon, Tom Melham - 1996