Free theorems and runtime type representations
DOI10.1016/J.ENTCS.2007.02.043zbMATH Open1316.68043OpenAlexW2131441325MaRDI QIDQ5262947FDOQ5262947
Authors: Dimitrios Vytiniotis, Stephanie Weirich 
Publication date: 10 July 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.043
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)
Cites Work
- Theorem Proving in Higher Order Logics
- Isabelle/HOL. A proof assistant for higher-order logic
- Title not available (Why is that?)
- Programming Languages and Systems
- Title not available (Why is that?)
- Guarded recursive datatype constructors
- A Framework for Extended Algebraic Data Types
- An extension of system \(F\) with subtyping
- Syntactic logical relations for polymorphic and recursive types
- Free theorems in the presence of seq
- Parametric polymorphism and operational equivalence
- Intensional polymorphism in type-erasure semantics
- Title not available (Why is that?)
- Title not available (Why is that?)
- A formalization of strong normalization for simply-typed lambda-calculus and System F
- Title not available (Why is that?)
- Meta-programming with built-in type equality
Cited In (3)
Uses Software
This page was built for publication: Free theorems and runtime type representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262947)
