3827 search results - page 462 / 766 » The Epsilon Generation Language |
128
click to vote
COLING
1992
15 years 8 months ago
1992
A small fragment of the Systemic Functional Grammar of the PENMANsystem is reformulated in the Typed Feature Structure language. Through this reformulation wc gain full reversibil...
173
click to vote
ACTA
2007
15 years 7 months ago
2007
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
204
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
167
click to vote
LOGCOM
2008
15 years 6 months ago
2008
This paper defines the grammar class of sequentially indexed grammars (SIGs) that results of a change in the index stack handling mechanism of indexed grammars [Aho68, Aho69]. SIG...
153
Voted
APAL
2005
15 years 6 months ago
2005
Systems of explicit mathematics provide an axiomatic framework to represent programs and to prove properties of them. We introduce such a system with a new form of power types usi...