Conflicting accounts of -definability

DOI10.1016/J.JLAMP.2016.11.001zbMATH Open1403.03020OpenAlexW2558783835MaRDI QIDQ511925FDOQ511925

Authors: Barry Jay, J. David Vergara 

Publication date: 22 February 2017

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2016.11.001

Recommendations

• On \(\lambda\)-definability of arithmetical functions with indeterminate values of arguments
• On \(\lambda \)-definable functions on ordinals
• On non-classical theory of computability
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• scientific article; zbMATH DE number 7178020

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Title not available (Why is that?)
• Programs as data structures in \(\lambda\)SF-calculus
• Title not available (Why is that?)
• A combinatory account of internal structure
• First-class patterns
• Pattern Calculus
• Title not available (Why is that?)

Cited In (7)

• On \(\lambda \)-definable functions on ordinals
• Intensional computation with higher-order functions
• On non-classical theory of computability
• Title not available (Why is that?)
• Self-quotation in a typed, intensional lambda-calculus
• Mutual definability does not imply definitional equivalence, a simple example
• On \(\lambda\)-definability of arithmetical functions with indeterminate values of arguments

This page was built for publication: Conflicting accounts of \(\lambda\)-definability

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