Sciweavers

39 search results - page 6 / 8
» Semantics of Higher-Order Recursion Schemes
Sort
View
ESOP
2007
Springer
14 years 2 months ago
Principal Type Schemes for Modular Programs
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...
Derek Dreyer, Matthias Blume
PLDI
2011
ACM
12 years 11 months ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...
JODL
2000
114views more  JODL 2000»
13 years 8 months ago
Integrating ontologies and thesauri for RDF schema creation and metadata querying
In this paper we present a new approach for building metadata schemas by integrating existing ontologies and structured vocabularies (thesauri). This integration is based on the s...
Bernd Amann, Irini Fundulaki, Michel Scholl
LREC
2010
144views Education» more  LREC 2010»
13 years 10 months ago
Mapping between Dependency Structures and Compositional Semantic Representations
This paper investigates the mapping between two semantic formalisms, namely the tectogrammatical layer of the Prague Dependency Treebank 2.0 (PDT) and (Robust) Minimal Recursion S...
Max Jakob, Markéta Lopatková, Valia ...
LFP
1992
140views more  LFP 1992»
13 years 9 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein