Sciweavers

Share
3 search results - page 1 / 1
» Syntactic Metatheory of Higher-Order Subtyping
Sort
View
CSL
2008
Springer
9 years 4 months ago
Syntactic Metatheory of Higher-Order Subtyping
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
Andreas Abel, Dulma Rodriguez
TPHOL
2005
IEEE
9 years 8 months ago
Mechanized Metatheory for the Masses: The PoplMark Challenge
Abstract. How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machinechecked proofs? We propose an initial set of b...
Brian E. Aydemir, Aaron Bohannon, Matthew Fairbair...
ICFP
2005
ACM
10 years 2 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
books