On Completability of Partial

Cached

Download Links

by Andrea Asperti , Agata Ciabattoni

Active Bibliography

7 Effective Applicative Structures – Andrea Asperti, Agata Ciabattoni, Piazza Porta, S. Donato - 1995
3 Completing Partial Combinatory Algebras with Unique Head-Normal Forms – Inge Bethke, Jan Willem Klop, Roel De Vrijer - 1996
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
I Basic Categories 6 – J. R. B. Cockett - 2010
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
14 Modified Realizability Toposes and Strong Normalization Proofs (Extended Abstract) – J.M.E. Hyland, C. -h. L. Ong - 1993
5 A Limiting First Order Realizability Interpretation – Masahiro Nakata, Susumu Hayashi
3 Towards Limit Computable Mathematics – Susumu Hayashi, Masahiro Nakata
Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli countermodels. – James Lipton, Lauchli Countermodels, Michael J. O'donnell - 1996
1 The Constructive Foundations of the System eb – D. E. Stevenson - 1996
2 Explicit Mathematics With The Monotone Fixed Point Principle. II: Models – Michael Rathjen - 1999
11 Induction And Recursion On The Real Line – Martín Hötzel Escardo
1 The intrinsic topology of a Martin-Löf universe – Martín H. Escardó - 2012
1 The New AI is General & Mathematically Rigorous – Jürgen Schmidhuber
The Fastest Way of Computing All Universes – Jürgen Schmidhuber
,- # (. " /01The Impossibility of an E¤ective Theory of Policy in a Complex Economy – K. Vela Velupillai - 2005
15 The New AI: General & Sound & Relevant for Physics – Jürgen Schmidhuber - 2003