Sciweavers

1375 search results - page 192 / 275
» SDL-2000: A Language with a Formal Semantics
Sort
View
DLT
2003
14 years 11 months ago
Boolean Grammars
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
Alexander Okhotin
EACL
1993
ACL Anthology
14 years 11 months ago
Inheriting Verb Alternations
The paper shows how the verbal lexicon can be formalised in a way that captures and exploits generalisations about the alternation behaviour of verb classes. An alternation is a p...
Adam Kilgarriff
ICFP
2008
ACM
15 years 9 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
OOPSLA
2004
Springer
15 years 3 months ago
Super and inner: together at last!
In an object-oriented language, a derived class may declare a method with the same signature as a method in the base class. The meaning of the re-declaration depends on the langua...
David S. Goldberg, Robert Bruce Findler, Matthew F...
POPL
2005
ACM
15 years 10 months ago
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
John Field, Carlos A. Varela