Sciweavers

105 search results - page 3 / 21
» Proving optimizations correct using parameterized program eq...
Sort
View
LICS
1989
IEEE
13 years 9 months ago
Computational Lambda-Calculus and Monads
The λ-calculus is considered an useful mathematical tool in the study of programming languages. However, if one uses βη-conversion to prove equivalence of programs, then a gros...
Eugenio Moggi
JAIR
2007
108views more  JAIR 2007»
13 years 5 months ago
Discovering Classes of Strongly Equivalent Logic Programs
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
Fangzhen Lin, Yin Chen
CALCO
2005
Springer
109views Mathematics» more  CALCO 2005»
13 years 11 months ago
Final Semantics for Event-Pattern Reactive Programs
Event-pattern reactive programs are front-end programs for distributed reactive components that preprocess an incoming stream of event stimuli. Their purpose is to recognize tempor...
César Sánchez, Henny B. Sipma, Matte...
LOPSTR
1997
Springer
13 years 9 months ago
Development of Correct Transformation Schemata for Prolog Programs
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
Julian Richardson, Norbert E. Fuchs
GI
2009
Springer
13 years 10 months ago
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
David Sabel, Manfred Schmidt-Schauß, Frederi...