Sciweavers

FPCA
1995
14 years 3 months ago
Bananas in Space: Extending Fold and Unfold to Exponential Types
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...
Erik Meijer, Graham Hutton
FPCA
1995
14 years 3 months ago
The Functional Side of Logic Programming
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...
Massimo Marchiori
FPCA
1995
14 years 3 months ago
Constructing Functional Programs for Grammar Analysis Problems
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...
Johan Jeuring, S. Doaitse Swierstra
FPCA
1995
14 years 3 months ago
How Much Non-Strictness do Lenient Programs Require?
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...
Klaus E. Schauser, Seth Copen Goldstein
FP
1995
110views Formal Methods» more  FP 1995»
14 years 3 months ago
Using Types to Parse Natural Language
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...
Mark P. Jones, Paul Hudak, Sebastian Shaumyan
FP
1995
156views Formal Methods» more  FP 1995»
14 years 3 months ago
Type Reconstruction for SCI
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...
Howard Huang, Uday S. Reddy
ICFP
1997
ACM
14 years 3 months ago
The Effectiveness of Flow Analysis for Inlining
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...
J. Michael Ashley
WFLP
2000
Springer
82views Algorithms» more  WFLP 2000»
14 years 3 months ago
Strong and NV-sequentiality of constructor systems
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...
Salvador Lucas
ECOOP
1995
Springer
14 years 3 months ago
Object Imaging
Satish R. Thatte
ECOOP
1995
Springer
14 years 3 months ago
Programming as an Experience: The Inspiration for Self
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...
Randall B. Smith, David Ungar