Gradual type theory
From MaRDI portal
Publication:5019016
DOI10.1017/S0956796821000125OpenAlexW3205784599MaRDI QIDQ5019016
Daniel R. Licata, Amal Ahmed, Max New
Publication date: 27 December 2021
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796821000125
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The interaction of contracts and laziness
- Space-efficient gradual typing
- Notions of computation and monads
- Dynamic typing: Syntax and proof theory
- Locus Solum: From the rules of logic to the logic of rules
- Dependent Types and Fibred Computational Effects
- Space-Efficient Manifest Contracts
- Abstracting gradual typing
- The gradualizer: a methodology and algorithm for generating gradual type systems
- Polarized Substructural Session Types
- Contracts for higher-order functions
- The Recursive Union of Some Gradual Types
- The design and implementation of typed scheme
- Typed Contracts for Functional Programming
- Well-Typed Programs Can’t Be Blamed
- Exploring the Design Space of Higher-Order Casts
- Foundations of dependent interoperability
- How to evaluate the performance of gradual type systems
- Call-by-name Gradual Type Theory
- Gradual type theory
- Contracts made manifest
- Threesomes, with and without blame
- Static contract checking for Haskell
- Contextual isomorphisms
- Do be do be do
- Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
- Automatically generating the dynamic semantics of gradually typed languages
- Models of a Non-associative Composition
- An Effect System for Algebraic Effects and Handlers
- Programming Languages and Systems
This page was built for publication: Gradual type theory
