Sciweavers

FPCA
1995
15 years 8 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
15 years 8 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»
15 years 8 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»
15 years 8 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
ICICS
1997
Springer
15 years 8 months ago
Duality of Boolean functions and its cryptographic significance
Xian-Mo Zhang, Yuliang Zheng, Hideki Imai