1017 search results - page 20 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
122
click to vote
AMAST
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
94
Voted
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
EACL
1989
ACL Anthology
14 years 10 months ago
1989
ACL Anthology
PEPM
2009
ACM
15 years 6 months ago
2009
ACM
ract interpretation of programs relates the exact semantics of a programming language to an approximate semantics that can be effectively computed. We show that, by specifying ope...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...