899 search results - page 45 / 180 » A CTL-Based Logic for Program Abstractions |
122
Voted
CLEF
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...
126
click to vote
ICLP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
113
click to vote
TPLP
2002
15 years 1 months ago
2002
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
160
click to vote
ICFP
2012
ACM
13 years 4 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
110
click to vote
FOSSACS
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...