Sciweavers

584 search results - page 21 / 117
» Logic Programs as term Rewriting Systems
Sort
View
INFORMATICALT
2000
108views more  INFORMATICALT 2000»
14 years 9 months ago
Theoretical Foundations of an Environment-Based Multiparadigm Language
The paper presents a simple programming language and rewriting system called GENS. It is based on an extension of the -calculus called E-calculus. GENS is a multiparadigm language:...
Mario Blazevic, Zoran Budimac, Mirjana Ivanovic
IFIP
2004
Springer
15 years 3 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
ENTCS
2008
101views more  ENTCS 2008»
14 years 9 months ago
Imperative LF Meta-Programming
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
Aaron Stump
ICTAC
2004
Springer
15 years 3 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
PPDP
2009
Springer
15 years 4 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano