Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
In this paper we study the relationships between logic programming and functional programming, trying to answer the following basic question: to what extent is logic programming j...
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 div...
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
We describe a natural language parser that uses type information to determine the grammatical structure of simple sentences and phrases. This stands in contrast to studies of type...
We present a type reconstruction algorithm for SCIR 10], a type system for a language with syntactic control of interference. SCIR guarantees that terms of passive type do not cau...
An interprocedural flow analysis can justify inlining in higher-order languages. In principle, more inlining can be performed as analysis accuracy improves. This paper compares fo...
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
The Self system attempts to integrate intellectual and non-intellectual aspects of programming to create an overall experience. The language semantics, user interface, and implemen...