815 search results - page 95 / 163 » Algebraic Recognizability of Languages |
133
click to vote
JSW
2006
15 years 6 months ago
2006
Abstract-- This paper describes a technique combining higher order functions, algebraic datatypes, and monads to incrementally implement syntax driven logics. Extensions can be com...
142
click to vote
TCS
2008
15 years 6 months ago
2008
We associate the iterated block product of a bimachine with a deterministic Turing machine. This allows us to introduce new algebraic notions to study the behavior of the Turing m...
145
click to vote
ICFP
1998
ACM
15 years 10 months ago
1998
ACM
In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion...
144
click to vote
WADT
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
152
click to vote
ITS
1998
Springer
15 years 9 months ago
1998
Springer
In some domains, including those requiring natural language understanding, we cannot build a system that can complete the entire task. One way to deal with such cases is to encode ...