Tridirectional typechecking
From MaRDI portal
Publication:3452267
DOI10.1145/964001.964025zbMath1325.68062MaRDI QIDQ3452267
Joshua Dunfield, Frank Pfenning
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.964025
68N15: Theory of programming languages
03B70: Logic in computer science
68Q55: Semantics in the theory of computing
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Termination checking with types, A type- and scope-safe universe of syntaxes with binding: their semantics and proofs, Set Constraints, Pattern Match Analysis, and SMT, Polarized subtyping, Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage, Graded modal dependent type theory, On the unity of duality, Extensible Datasort Refinements, Refinement Types as Proof Irrelevance, On the Values of Reducibility Candidates
Uses Software