Results 1 
6 of
6
Constructing Functional Programs for Grammar Analysis Problems
 In Conference Record of FPCA '95, SIGPLANSIGARCHWG2.8 Conference on Functional Programming Languages and Computer Architecture
, 1995
"... This paper discusses the derivation of functional programs for grammar analysis problems, such as the Empty problem and the Reachable problem. Grammar analysis problems can be divided into two classes: topdown problems such as Follow and Reachable, which are described in terms of the contexts of n ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
This paper discusses the derivation of functional programs for grammar analysis problems, such as the Empty problem and the Reachable problem. Grammar analysis problems can be divided into two classes: topdown problems such as Follow and Reachable, which are described in terms of the contexts of nonterminals, and bottomup problems such as Empty and First, which do not refer to contexts. In a previous paper we derive a program for bottomup grammar analysis problems. In this paper we derive a program for topdown grammar analysis problems by transforming the specification of an arbitrary topdown problem into a program. The existence of a solution is guaranteed provided some natural conditions are satisfied. Furthermore, we describe a general transformation that applies to both classes of grammar analysis problems. The result of this transformation is a program that avoids unnecessary computations in the computation of a fixed point. Constructor classes, which are used to abstract fr...
Abstract interpretation of algebraic polynomial systems (Extended Abstract)
 PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY, AMAST ’97
, 1997
"... We define a hierarchy of compositional formal semantics of algebraic polynomial systems over Falgebras by abstract interpretation. This generalizes classical formal language theoretical results and contextfree grammar flowanalysis algorithms in the same uniform framework of universal algebra and ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We define a hierarchy of compositional formal semantics of algebraic polynomial systems over Falgebras by abstract interpretation. This generalizes classical formal language theoretical results and contextfree grammar flowanalysis algorithms in the same uniform framework of universal algebra and abstract interpretation.
Modal Logics for Representing Incoherent Knowledge
 In Handbook of Defeasible Reasoning and Uncertainty Management
, 1995
"... In this paper we review ways of representing incoherent 'knowledge' in a consistent way, where the use of modal logic and Kripkestyle semantics is put central. Starting with a presentation of the basic modal framework, we discuss the basic modal systems K, KD (with an excursion to the representatio ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this paper we review ways of representing incoherent 'knowledge' in a consistent way, where the use of modal logic and Kripkestyle semantics is put central. Starting with a presentation of the basic modal framework, we discuss the basic modal systems K, KD (with an excursion to the representation of conflicting norms in deontic logic) and Chellas' minimal modal logic D. Next we look at the epistemic logics KD45, S4 and S5, including the logical omniscience problem and several nonstandard modal logics to overcome this problem. After this we turn to the issue of reasoning by default, where a conflict of defaults (or default beliefs) may arise. We give an epistemic treatment of default reasoning, and treat the way conflicts of defaults can be solved viewed from the more general perspective of resolving conflicts in meta level reasoning. Furthermore, special attention is paid to specificity in default reasoning as a principle to solve these conflicts, for which we develop an extension of Halpern & Moses' theory of honest formulas. Finally, we discuss several numerical modal logics in their capacity of ways of representation of incoherent information.
Regular Algebra Applied to Language Problems
, 2004
"... Many functions on contextfree languages can be expressed in the form of the least xed point of a function whose de nition mimics the grammar of the given language. Examples include the function returning the length of the shortest word in a language, and the function returning the smallest num ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Many functions on contextfree languages can be expressed in the form of the least xed point of a function whose de nition mimics the grammar of the given language. Examples include the function returning the length of the shortest word in a language, and the function returning the smallest number of edit operations required to transform a given word into a word in a language.
Trends and Developments in Computational Geometry
 Computer Graphics Forum
, 1995
"... This report discusses some trends and achievements in computational geometry during the past five years, with emphasis on problems related to computer graphics. Furthermore, a direction of research in computational geometry is discussed, which could help in bringing the fields of computational ge ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This report discusses some trends and achievements in computational geometry during the past five years, with emphasis on problems related to computer graphics. Furthermore, a direction of research in computational geometry is discussed, which could help in bringing the fields of computational geometry and computer graphics closer together.
Advanced Programming Concepts in a Course on Grammars and Parsing
"... One of the important goals of the Computer Science curriculum at Utrecht University is to familiarize students with abstract programming concepts such as, for example, partial evaluation and deforestation. A course on grammars and parsing offers excellent possibilities for exemplifying and introduci ..."
Abstract
 Add to MetaCart
One of the important goals of the Computer Science curriculum at Utrecht University is to familiarize students with abstract programming concepts such as, for example, partial evaluation and deforestation. A course on grammars and parsing offers excellent possibilities for exemplifying and introducing such concepts. We have developed a course that exemplifies higherorder functions and lazy evaluation, and introduces abstract programming concepts such as partial evaluation, generic programming, deforestation, and abstract interpretation. This paper describes how we deal with these concepts in the course on grammars and parsing.