Semantic subtyping for non-strict languages
From MaRDI portal
Publication:5091145
Recommendations
Cites work
- A core calculus for XQuery 3.0. Combining navigational and pattern matching approaches
- Automata, Languages and Programming
- CDuce: an XML-centric general-purpose language
- Computer Science Logic
- General Recursion via Coinductive Types
- scientific article; zbMATH DE number 1956517 (Why is no real title available?)
- Nixos: a purely functional Linux distribution
- Polymorphic functions with set-theoretic types. I: Syntax, semantics, and evaluation
- Polymorphic functions with set-theoretic types. II: Local type inference and type reconstruction
- Refinement types for Haskell
- Semantic subtyping with an SMT solver
- Semantic subtyping, dealing set-theoretically with function, union, intersection, and negation types
- Semantic types: a fresh look at the ideal model for types
- Set-theoretic foundation of parametric polymorphism and subtyping
- Set-theoretic types for polymorphic variants
- Static and dynamic semantics of NoSQL languages
- The call-by-need lambda calculus
- The call-by-need lambda calculus
Cited in
(4)
This page was built for publication: Semantic subtyping for non-strict languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091145)