194 search results - page 1 / 39 » A Rewriting Semantics for Type Inference |
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
When students first learn programming, they often rely on a simple operational model of a program’s behavior to explain how particular features work. Because such models build o...
JLP
2006
13 years 5 months ago
2006
This paper describes in detail how to bridge the gap between theory and practice when implementing in Maude structural operational semantics described in rewriting logic, where tr...
AISC
1992
Springer
13 years 9 months ago
1992
Springer
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
VLDB
1998
ACM
13 years 9 months ago
1998
ACM
The goal of the COKO-KOLA project [10, 91 is to express rules of rule-basedoptimizers in a mannerpermitting verification with a theoremprover. In [IO], we consideredquerytransform...
ENTCS
2000
13 years 5 months ago
2000
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...