224 search results - page 24 / 45 » An extension of the program derivation format |
POPL
1993
ACM
13 years 11 months ago
1993
ACM
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typ...
ESOP
2006
Springer
13 years 11 months ago
2006
Springer
We present a sound and complete method for reasoning about contextual equivalence in the untyped, imperative object calculus of Abadi and Cardelli [1]. Our method is based on bisim...
PEPM
2000
ACM
13 years 11 months ago
2000
ACM
Transforming recursion into iteration eliminates the use of stack frames during program execution. It has been studied extensively. This paper describes a powerful and systematic ...
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
SCCC
1998
IEEE
13 years 11 months ago
1998
IEEE
Software architectural design is essential for complex distributed applications. Architectural specifications need to define the key aspects of the application, including its inte...