Sciweavers

24 search results - page 3 / 5
» Word Operation Closure and Primitivity of Languages
Sort
View
POPL
1998
ACM
13 years 9 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
CSR
2007
Springer
13 years 11 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
POPL
1996
ACM
13 years 9 months ago
A Practical and Flexible Flow Analysis for Higher-Order Languages
operators. The analysis is abstract interpretation-based and is parameterized over two polyvariance operators and a projection operator. These operators are used to regulate the sp...
J. Michael Ashley
IFL
2001
Springer
13 years 9 months ago
Proving the Correctness of the STG Machine
Abstract. J. Launchbury gave an operational semantics for lazy evaluation and showed that it is sound and complete w.r.t. a denotational s of the language. P. Sestoft then introduc...
Alberto de la Encina, Ricardo Pena
EDBT
2008
ACM
178views Database» more  EDBT 2008»
14 years 5 months ago
An inductive database and query language in the relational model
In the demonstration, we will present the concepts and an implementation of an inductive database ? as proposed by Imielinski and Mannila ? in the relational model. The goal is to...
Lothar Richter, Jörg Wicker, Kristina Kessler...