Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

TYPES
2000
Springer

favoriteEmaildiscussreport

125views Formal Methods» more TYPES 2000»

Formalizing the Halting Problem in a Constructive Type Theory

13 years 8 months ago

Formalizing the Halting Problem in a Constructive Type Theory

Download cs.simons-rock.edu

We present a formalization of the halting problem in Agda, a language based on Martin-L

Kristofer Johannisson

Real-time Traffic

Constructive Halting Problem | Formal Methods | Halting Problem | Type Theory | TYPES 2000 |

claim paper

Related Content

» Some thoughts on hypercomputation

» Towards Formalizing Categorical Models of Type Theory in Type Theory

» On the Learnability of the Uncomputable

» Universal Algebra in Type Theory

» Simple Types in Type Theory Deep and Shallow Encodings

» A Dependent Type Theory with Names and Binding

» Reasoning about Objectbased Calculi in CoInductive Type Theory and the Theory of Contexts

» Productivity of EdalatPotts Exact Arithmetic in Constructive Type Theory

» Deriving Category Theory from Type Theory

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	TYPES
Authors	Kristofer Johannisson

Comments (0)