Fundamentals of Computation Theory

DOI10.1007/11537311MaRDI QIDQ5492941zbMATH OpenOpenAlexFDO

Authors Aleksy Schubert

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11537311

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 2090083
• Higher Order   Matching is Undecidable
• scientific article; zbMATH DE number 1948184
• Third order matching is decidable
• Dependency Tree Automata

Cited in

(3)

• Program self-reference in constructive Scott subdomains
• The variable containment problem
• Simply-typed underdeterminism

Describes a project that uses

Uses Software

• HOL Light

This page was built for publication: Fundamentals of Computation Theory

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