|
1
|
Realizability as the connection between constructive and computable mathematics. Available at http://math.andrej.com
– Andrej Bauer
- 2005
|
|
1
|
Tutorial lecture at Computability and Complexity in Analysis 2005
– RZ http math andrej comrz
|
|
1
|
Computability and complexity in analysis. Informatik Berichte 302, FernUniversität in
– Hagen Hagen
- 2003
|
|
1
|
Lattice theory, datatypes and semantics
– D S Scott
- 1972
|
|
2
|
Interval Analysis. Automatic Computation
– R E Moore
|
|
17
|
Matching typed and untyped realizability
– J R Longley
- 1999
|
|
34
|
The Realizability Approach to Computable Analysis and Topology
– Andrej Bauer, Steven M. Awodey, Lenore Blum, Abbas Edalat, Frank Pfenning
- 2000
|
|
30
|
Garrigue, Didier Rémy and Jéróme Vouillon: The Objective Caml System
– Xavier Leroy, Damien Doligez, Jacques
- 2010
|
|
201
|
An Introduction to Computable Analysis
– K Weihrauch
- 2000
|
|
60
|
Recursive unsolvability of a problem of Thue
– E Post
- 1947
|
|
1
|
A domain model characterising strong normalisation
– U Berger
|
|
1
|
Realizability interpretation of proofs in constructive
– H Schwichtenberg
|
|
1
|
Realizability of monotone coinductive definitions and its application to program synthesis
– Theory Comput Sys, to appear
- 1998
|
|
14
|
Computing with Real Numbers - I. The LFT Approach to Real Number Computation - II. A Domain Framework for Computational Geometry
– Abbas Edalat, Reinhold Heckmann
- 2002
|
|
7
|
Iteration and Coiteration Schemes for Higher-Order and Nested Datatypes
– Andreas Abel, Ralph Matthes, Tarmo Uustalu
- 2004
|
|
4
|
Continuous functions on final coalgebras
– Neil Ghani, Peter Hancock, Dirk Pattinson
- 2007
|
|
9
|
Monotone Inductive and Coinductive Constructors of Rank 2
– Ralph Matthes
- 2001
|
|
3
|
Hybrid Functional Interpretations
– Mircea-dan Hernest, Paulo Oliva
|
|
5
|
Realizability interpretation of proofs in constructive analysis
– Helmut Schwichtenberg
- 2006
|
