850 search results - page 137 / 170 » A Logic Programming Language Based on Binding Algebras |
119
click to vote
JLP
2008
15 years 1 months ago
2008
Based on a set of criteria and a measuring lattice, we introduce relational measures as generalizations of fuzzy measures. The latter have recently made their way from the interva...
103
click to vote
ENTCS
2008
15 years 1 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
112
click to vote
FORTE
2007
15 years 2 months ago
2007
Abstract. We present and discuss a formal, high-level approach to the specification and composition of interaction protocols for service-oriented systems. This work is being develo...
140
click to vote
ICFP
2004
ACM
16 years 1 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
115
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...