Partiality, State and Dependent Types
From MaRDI portal
Publication:3007667
DOI10.1007/978-3-642-21691-6_17zbMath1331.03020OpenAlexW1565968479MaRDI QIDQ3007667
Aleksandar Nanevski, Kasper Svendsen, Lars Birkedal
Publication date: 17 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21691-6_17
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursion over realizability structures
- The Vienna development method: The meta-language
- Categorical logic and type theory
- Representing inductively defined sets by wellorderings in Martin-Löf's type theory
- Wellfounded trees in categories
- Proof of correctness of data representations
- Partiality, State and Dependent Types
- Interacting with Modal Logics in the Coq Proof Assistant
- Hoare type theory, polymorphism and separation
- Realisability semantics of parametric polymorphism, general references and recursive types
- Ynot
- Structuring the verification of heap-manipulating programs
- General Recursion via Coinductive Types
- A Realizability Model for Impredicative Hoare Type Theory
- Automata, Languages and Programming
This page was built for publication: Partiality, State and Dependent Types
