42 search results - page 3 / 9 » Pure Type Systems in Rewriting Logic: Specifying Typed Highe... |
RCC
2002
13 years 5 months ago
2002
In recent years Arvind's Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specifi...
FLOPS
2010
Springer
14 years 1 months ago
2010
Springer
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
POPL
2010
ACM
14 years 3 months ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
POPL
2007
ACM
14 years 6 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
GPCE
2007
Springer
14 years 9 days ago
2007
Springer
Maintaining integrity, consistency, and enforcing conformance in architectures of large-scale systems requires specification and enforcement of many different forms of structural...