Semantic types
From MaRDI portal
Publication:3452249
DOI10.1145/964001.964006zbMath1325.68072OpenAlexW2034043336MaRDI QIDQ3452249
Jérôme Vouillon, Paul-André Melliès
Publication date: 11 November 2015
Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/964001.964006
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (8)
Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ A solution to the PoplMark challenge based on de Bruijn indices ⋮ A System F with Call-by-Name Exceptions ⋮ Well-founded recursion with copatterns and sized types ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Values of Reducibility Candidates ⋮ Syntactic Logical Relations for Polymorphic and Recursive Types
This page was built for publication: Semantic types
