A System F with Call-by-Name Exceptions

DOI10.1007/978-3-540-70583-3_27MaRDI QIDQ3519511zbMATH OpenOpenAlexFDO

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

Recommendations

• A type system for call-by-name exceptions
• scientific article; zbMATH DE number 2185662
• An intuitionistic λ-calculus with exceptions
• An extension of system \(F\) with subtyping
• scientific article; zbMATH DE number 1956517

Cites work

• A functional theory of exceptions
• An intuitionistic λ-calculus with exceptions
• Comparing control constructs by double-barrelled CPS
• Comprehending monads
• scientific article; zbMATH DE number 3907744 (Why is no real title available?)
• Locus solum: From the rules of logic to the logic of rules.
• Notions of computation and monads
• Polymorphic type inference and containment
• Semantic types: a fresh look at the ideal model for types
• The marriage of effects and monads
• Typability and type checking in System F are equivalent and undecidable

Cited in

(4)

• Unchecked exceptions can be strictly more powerful than call/cc
• scientific article; zbMATH DE number 2185662 (Why is no real title available?)
• A type system for call-by-name exceptions
• Validating Brouwer's continuity principle for numbers using named exceptions

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

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