Sciweavers

295 search results - page 3 / 59
» Typed transformations of typed abstract syntax
Sort
View
POPL
1998
ACM
13 years 10 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...
CLEIEJ
2010
13 years 3 months ago
Typing Textual Entities and M2T/T2M Transformations in a Model Management Environment
Global Model Management (GMM) is a model-based approach for managing large sets of interrelated heterogeneous and complex MDE artifacts. Such artifacts are usually represented as ...
Andrés Vignaga
DEBU
1999
85views more  DEBU 1999»
13 years 5 months ago
Specifying Database Transformations in WOL
WOL is a Horn-clause language for specifying transformations involving complex types and recursive data-structures. Its declarative syntax makes programs easy to modify in respons...
Susan B. Davidson, Anthony Kosky
SCP
2010
155views more  SCP 2010»
13 years 4 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
TOPLAS
2010
115views more  TOPLAS 2010»
13 years 4 months ago
JavaCOP: Declarative pluggable types for java
program constraints are defined over a program’s abstract syntax tree. The JAVACOP compiler automatically enforces these constraints on programs during compilation. The JAVACOP ...
Shane Markstrum, Daniel Marino, Matthew Esquivel, ...