4212 search results - page 288 / 843 » Rights Expression Languages |
156
Voted
FPCA
1989
15 years 10 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
170
click to vote
LICS
1989
IEEE
15 years 10 months ago
1989
IEEE
We explore ideal models for a programming language with recursive polymorphic types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable ideals yiel...
166
click to vote
ATVA
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we describe a first-order linear time temporal logic (LTL) model checker based on multiway decision graphs (MDG). We developed a first-order temporal language, LMDG ...
146
click to vote
ANLP
1997
15 years 8 months ago
1997
rietary Semantico-Syntactic Abstraction Language (SAL) the parser is able to achieve better results than syntactic analysis alone would allow. This comprehensive analysis permits t...
175
click to vote
COLING
1992
15 years 7 months ago
1992
The normal method for representing anaphoric dependencies in Unification Based grammar tbrmalisms is that of re-entrance. In this paper, we address the problems that this represen...