scientific article; zbMATH DE number 445161

MaRDI QIDQ3142168zbMATH OpenFDO

Authors Paweł Urzyczyn

Publication date 5 December 1993

zbMATH Keywords

terminationprimitive recursive definitionscomputability over abstract struturesexistential quantification in typeshalting problem over finite interpretations

Mathematics Subject Classification ID

Theory of programming languages (68N15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80)

Recommendations

• Primitive recursive functional with dependent types
• scientific article; zbMATH DE number 16188
• Computer Science Logic
• Primitive recursion in the abstract
• Simple general recursion in type theory
• Recursive types for Fun
• Type inference with recursive types: Syntax and semantics
• Recursive type generativity
• Recursive type generativity
• Primitive recursion for higher-order abstract syntax

Cited in

(4)

• Stratified polymorphism and primitive recursion
• Primitive recursion for higher-order abstract syntax
• scientific article; zbMATH DE number 2185713 (Why is no real title available?)
• Primitive recursive selection functions for existential assertions over abstract algebras

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 Q3142168)