Sciweavers

596 search results - page 96 / 120
» Subtyping Recursive Types
Sort
View
FSEN
2009
Springer
15 years 6 months ago
Termination in Higher-Order Concurrent Calculi
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
SAIG
2001
Springer
15 years 4 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann
ELP
1991
15 years 3 months ago
Natural Semantics and Some of Its Meta-Theory in Elf
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
Spiro Michaylov, Frank Pfenning
COLING
2010
14 years 6 months ago
DL Meet FL: A Bidirectional Mapping between Ontologies and Linguistic Knowledge
We present a transformation scheme that mediates between description logics (DL) or RDF-encoded ontologies and type hierarchies in feature logics (FL). The DL-to-FL direction is i...
Hans-Ulrich Krieger, Ulrich Schäfer
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 6 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...