Formalization of the undecidability of the halting problem for a functional language
From MaRDI portal
Publication:1799282
DOI10.1007/978-3-662-57669-4_11OpenAlexW2811265870MaRDI QIDQ1799282
Aaron Dutle, Thiago Mendonça Ferreira Ramos, Mauricio Ayala-Rincón, César A. Muñoz, Anthony Narkawicz, Mariano M. Moscato
Publication date: 18 October 2018
Full work available at URL: https://doi.org/10.1007/978-3-662-57669-4_11
Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Undecidability and degrees of sets of sentences (03D35)
Related Items (2)
Formal verification of termination criteria for first-order recursive functions ⋮ Formalization of the computational theory of a Turing complete functional language model
This page was built for publication: Formalization of the undecidability of the halting problem for a functional language
