A System F with Call-by-Name Exceptions

DOI10.1007/978-3-540-70583-3_27zbMath1155.68369OpenAlexW1496871832MaRDI QIDQ3519511

Sylvain Lebresne

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_27

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Validating Brouwer's continuity principle for numbers using named exceptions

Cites Work

• Unnamed Item
• Notions of computation and monads
• A functional theory of exceptions
• Polymorphic type inference and containment
• Typability and type checking in System F are equivalent and undecidable
• Comparing control constructs by double-barrelled CPS
• Locus Solum: From the rules of logic to the logic of rules
• Semantic types
• Comprehending monads
• An intuitionistic λ-calculus with exceptions
• The marriage of effects and monads

This page was built for publication: A System F with Call-by-Name Exceptions