Polymorphic functions with set-theoretic types. I: Syntax, semantics, and evaluation
DOI10.1145/2535838.2535840zbMATH Open1284.68126OpenAlexW2047304692MaRDI QIDQ5408397FDOQ5408397
Authors:
Publication date: 10 April 2014
Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2535838.2535840
Recommendations
Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cited In (11)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The recursive union of some gradual types
- Polarized subtyping
- Reachability analysis of innermost rewriting
- Taming the merge operator
- Set-theoretic types for polymorphic variants
- Bifibrational functorial semantics of parametric polymorphism
- Polymorphic functions with set-theoretic types. II: Local type inference and type reconstruction
- Polymorphic Abstract Syntax via Grothendieck Construction
- Disjoint polymorphism
This page was built for publication: Polymorphic functions with set-theoretic types. I: Syntax, semantics, and evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408397)