Sciweavers

3516 search results - page 15 / 704
» Programming Languages: Application and Interpretation
Sort
View
LOPSTR
1992
Springer
15 years 1 months ago
Logimix: A Self-Applicable Partial Evaluator for Prolog
We present a self-applicable partial evaluator for a large subset of full Prolog. The partial evaluator, called Logimix, is the result of applying our experience from partial eval...
Torben Æ. Mogensen, Anders Bondorf
76
Voted
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 9 months ago
Mechanized semantics
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
Xavier Leroy
FOSSACS
2004
Springer
15 years 3 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
AIIA
2007
Springer
15 years 3 months ago
A Top Down Interpreter for LPAD and CP-Logic
Logic Programs with Annotated Disjunctions and CP-logic are two different but related languages for expressing probabilistic information in logic programming. The paper presents a...
Fabrizio Riguzzi
TPHOL
2003
IEEE
15 years 2 months ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd