[PDF][PDF] 2e boerhaavestraat 49 amsterdam

JW DE BAKKER, LGLT MEERTENS - ir.cwi.nl
By an unpublished result of Scott, the inductive characterization of the while statement (due
to Hoare) is equivalent to its minimal fixed point characterization. In order to obtain a …

[CITAAT][C] REPAIRING THE PARENTHESIS SKELETON OF ALGOL 68 PROGRAMS: PROOF OF CORRECTNESS.

LGLT Meertens, JC van Vliet - 1975 - pascal-francis.inist.fr
REPAIRING THE PARENTHESIS SKELETON OF ALGOL 68 PROGRAMS: PROOF OF
CORRECTNESS. CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic …

[PDF][PDF] Program invariants as fixedpoints.

EM Clarke - Computing, 1979 - cs.cmu.edu
Program Invariants as Fixedpoints. We argue that soundness and relative completeness
theorems for Floyd-Hoare Axiom Systems ([3],[5],[18]) are really fixedpoint theorems. We give a …

Programminvarianten als Fixpunkte

EM Clarke - Computing, 1979 - Springer
We argue that soundness and relative completeness theorems for Floyd-Hoare Axiom
Systems ([3], [5], [18]) are really fixedpoint theorems. We give a characterization of program …

[PDF][PDF] Towards an A x Grammar for Turkish

CHA Koster, R Willems - Proceedings of the Sixth International Symposium on … - Citeseer
A x Grammars over a Finite Lattice (agfls), a simple form of two-level grammars admitting
quite e cient implementations, are proposed as a formalism to express the syntax of natural …

[BOEK][B] Informatics and syntax

CHA Koster - 1993 - Citeseer
Informatics and linguistics have a common interest in syntax. This article is concerned with
the historical development of the role of syntax in informatics and its relevance for linguistics. …

LL versus LR parsing with illustrations from ALGOL 68

RB Hunter, AD McGettrick, R Patel - ACM SIGPLAN Notices, 1977 - dl.acm.org
The relative merits of LL and LR parsing methods are compared, particular reference being
made to ALGOL 68. The fact that LR methods can be applied to a wider class of languages …

Affix grammars for natural languages

CHA Koster - International summer school on attribute grammars …, 1991 - Springer
Affix Grammars over a Finite Lattice (AGFLs), a simple form of two-level grammars admitting
quite efficient implementations, are proposed as a formalism to express the syntax of natural …

[PDF][PDF] A x grammars for natural languages

CHA Koster - … and Systems, International Summer School SAGA, 1991 - Citeseer
A x Grammars over a Finite Lattice (agfls), a simple form of two-level grammars admitting
quite e cient implementations, are proposed as a formalism to express the syntax of natural …

[CITAAT][C] An A x grammar for a part of the English language

LGLT Meertens, CHA Koster - Euratom Colloquium, University of Amsterdam, 1962