Sciweavers

247 search results - page 14 / 50
» A Computational Structure for the Propositional Calculus
Sort
View
CADE
2007
Springer
14 years 7 months ago
Dependency Pairs for Rewriting with Non-free Constructors
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...
Stephan Falke, Deepak Kapur
CONCUR
2006
Springer
13 years 11 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
ESOP
2006
Springer
13 years 11 months ago
Pure Pattern Calculus
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
C. Barry Jay, Delia Kesner
IFIPTCS
2010
13 years 5 months ago
Concurrent Pattern Calculus
Abstract. Concurrent pattern calculus drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising fro...
Thomas Given-Wilson, Daniele Gorla, Barry Jay
CIE
2006
Springer
13 years 11 months ago
Deep Inference and Its Normal Form of Derivations
Abstract. We see a notion of normal derivation for the calculus of structures, which is based on a factorisation of derivations and which is more general than the traditional notio...
Kai Brünnler