Sciweavers

1989 search results - page 146 / 398
» Set functions for functional logic programming
Sort
View
ESOP
2006
Springer
15 years 7 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
ENTCS
2007
105views more  ENTCS 2007»
15 years 3 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
ELP
1991
15 years 6 months ago
Natural Semantics and Some of Its Meta-Theory in Elf
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
Spiro Michaylov, Frank Pfenning
ICFP
2009
ACM
16 years 3 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
ACMSE
2006
ACM
15 years 7 months ago
Yaccscript: a platform for intersecting high-level languages
Programming paradigms are often skewed towards a particular domain of problems, thus one effective way to utilize them is through a multiparadigm approach to software development....
John Healey