Formalization of the undecidability of the halting problem for a functional language

DOI10.1007/978-3-662-57669-4_11MaRDI QIDQ1799282zbMATH OpenOpenAlexFDO

Authors Thiago Mendonça Ferreira Ramos, César Muñoz, Mauricio Ayala-Rincón, Mariano M. Moscato, Aaron Dutle, Anthony Narkawicz

Publication date 18 October 2018

Full work available at URL https://doi.org/10.1007/978-3-662-57669-4_11

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

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

Cited in

(9)

• Formalization of the computational theory of a Turing complete functional language model
• scientific article; zbMATH DE number 4021118 (Why is no real title available?)
• A Mechanical Proof of the Unsolvability of the Halting Problem
• The problem of termination of programs
• scientific article; zbMATH DE number 2085172 (Why is no real title available?)
• The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian
• Formal verification of termination criteria for first-order recursive functions
• GOL in GOL in HOL: verified circuits in Conway's game of life
• On the strongly generic undecidability of the halting problem

This page was built for publication: Formalization of the undecidability of the halting problem for a functional language

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