scientific article; zbMATH DE number 2085172

MaRDI QIDQ4736396zbMATH OpenFDO

Authors Kristofer Johannisson

Publication date 9 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2277/22770145.htm

zbMATH Keywords

Agdaundecidabilityintuitionistic type theoryhalting problemabstract model of computation

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Formalization of the undecidability of the halting problem for a functional language
• A Mechanical Proof of the Unsolvability of the Halting Problem
• The problem of termination of programs
• scientific article; zbMATH DE number 4021118
• Formalization of the computational theory of a Turing complete functional language model

Cited in

(7)

• Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
• scientific article; zbMATH DE number 2061708 (Why is no real title available?)
• scientific article; zbMATH DE number 4021118 (Why is no real title available?)
• HM(X) type inference is CLP(X) solving
• Formalization of the undecidability of the halting problem for a functional language
• Halting still standing -- programs versus specifications
• Formalization of the computational theory of a Turing complete functional language model

Describes a project that uses

Uses Software

• Agda

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736396)