3239 search results - page 197 / 648 » A Logical Process Calculus |
150
click to vote
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
103
click to vote
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
128
click to vote
NMR
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a computational model for reasoning with causal explanations of observations within the framework of Abductive Event Calculus (AEC). The model is based on abdu...
130
Voted
PODS
2010
ACM
15 years 8 months ago
2010
ACM
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
132
Voted
ICFP
2000
ACM
15 years 7 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...