17 search results - page 1 / 4 » Recursive Types in Games: Axiomatics and Process Representat... |
LICS
1998
IEEE
13 years 9 months ago
1998
IEEE
FOSSACS
2009
Springer
14 years 2 days ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
APLAS
2003
ACM
13 years 10 months ago
2003
ACM
When constructing programs to process XML documents, we immediately face the question as to how XML documents should be represented internally in the programming language we use. C...
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
EACL
1993
ACL Anthology
13 years 6 months ago
1993
ACL Anthology
The formal architecture of Lexical Functional Grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a...