2722 search results - page 189 / 545 » Automating Language Evolution |
132
click to vote
FLOPS
2010
Springer
15 years 12 months ago
2010
Springer
Disproof can be as important as proof in studying programs and programming languages. In particular, side conditions in a statement about program behavior are sometimes best unders...
138
Voted
CL
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
107
click to vote
CSL
2000
Springer
15 years 9 months ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
153
Voted
LICS
1993
IEEE
15 years 9 months ago
1993
IEEE
This paper presents an untyped lambda calculus, extended with object primitives that reflect the capabilities of so-called delegation-based object-oriented languages. A type infer...
144
click to vote
CSL
2004
Springer
15 years 8 months ago
2004
Springer
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...