Sciweavers

1375 search results - page 120 / 275
» SDL-2000: A Language with a Formal Semantics
Sort
View
PPDP
2007
Springer
15 years 4 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
TPHOL
2007
IEEE
15 years 4 months ago
Simple Types in Type Theory: Deep and Shallow Encodings
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
François Garillot, Benjamin Werner
ACL
1990
14 years 11 months ago
The Limits of Unification
Current complex-feature based grammars use a single procedure--unification--for a multitude of purposes, among them, enforcing formal agreement between purely syntactic features. ...
Robert Ingria
ER
2005
Springer
146views Database» more  ER 2005»
15 years 3 months ago
Kuaba Ontology: Design Rationale Representation and Reuse in Model-Based Designs
This paper presents the Kuaba Ontology, a knowledge representation model for Design Rationale described in an ontology definition language. The representation of this model in a sp...
Adriana Pereira de Medeiros, Daniel Schwabe, Bruno...
PPDP
2007
Springer
15 years 4 months ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel