22 search results - page 4 / 5 » Mechanizing the Metatheory of LF |
POPL
2012
ACM
12 years 1 months ago
2012
ACM
We present a formal operational semantics and its Coq mechanization for the C++ object model, featuring object construction and destruction, shared and repeated multiple inheritan...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
POPL
2012
ACM
12 years 1 months ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
ACL2
2006
ACM
13 years 11 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
FOSSACS
2001
Springer
13 years 10 months ago
2001
Springer
The rewriting calculus, or Rho Calculus (ρCal), is a simple calculus that uniformly integrates abstraction on patterns and nondeterminism. Therefore, it fully integrates rewriting...