Coercive subtyping: theory and implementation
From MaRDI portal
Publication:1951591
DOI10.1016/j.ic.2012.10.020zbMath1267.03042OpenAlexW2158657245MaRDI QIDQ1951591
Taoxue Xue, Zhaohui Luo, Serguei V. Solov'ev
Publication date: 6 June 2013
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2012.10.020
type theorycoercive subtypingconservativitydefinitional extensionproof assistant \texttt{Plastic}subsumptive subtyping
Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Second- and higher-order arithmetic and fragments (03F35)
Related Items (6)
Propositional forms of judgemental interpretations ⋮ Proof Assistants for Natural Language Semantics ⋮ Adjectival and adverbial modification: the view from modern type theories ⋮ Natural language inference in Coq ⋮ Implementing type theory in higher order constraint logic programming ⋮ Automorphisms of types in certain type theories and representation of finite groups
Uses Software
This page was built for publication: Coercive subtyping: theory and implementation
