A Type of Partial Recursive Functions

DOI10.1007/978-3-540-71067-7_12zbMath1165.68351OpenAlexW1802255488MaRDI QIDQ3543653

Ana Bove, Venanzio Capretta

Publication date: 4 December 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-71067-7_12

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items

Another Look at Function Domains

Uses Software

• Coq
• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The calculus of constructions
• Recursive coalgebras from comonads
• Computation by Prophecy
• General Recursion via Coinductive Types
• Modelling general recursion in type theory
• Typed Lambda Calculi and Applications
• Logical Approaches to Computational Barriers