3440 search results - page 63 / 688 » Logics For Context-Free Languages |
163
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
160
click to vote
SAS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
252
click to vote
JUCS
2006
15 years 6 months ago
2006
: Several techniques for implementing Prolog in a efficient manner have been devised since the original interpreter, many of them aimed at achieving more speed. There are two main ...
144
click to vote
DLT
2009
15 years 4 months ago
2009
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tili...
174
click to vote
SCP
1998
15 years 6 months ago
1998
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...