194 search results - page 4 / 39 » A Rewriting Semantics for Type Inference |
SFP
2001
13 years 8 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
POPL
1994
ACM
13 years 11 months ago
1994
ACM
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
ICOODB
2009
13 years 5 months ago
2009
The integration of database and programming languages is made difficult by the different data models and type systems prevalent in each field. Functional-object query languages con...
AMAST
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
The K framework, based on rewriting logic semantics, provides a powerful logic for deļ¬ning the semantics of programming languages. While most work in this area has focused on deļ...