Sciweavers

278 search results - page 35 / 56
» Pure Pattern Calculus
Sort
View
LICS
2007
IEEE
14 years 4 months ago
Higher-Order Matching, Games and Automata
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
Colin Stirling
LPAR
2004
Springer
14 years 3 months ago
Second-Order Matching via Explicit Substitutions
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
Flávio L. C. de Moura, Fairouz Kamareddine,...
ENTCS
2008
86views more  ENTCS 2008»
13 years 10 months ago
Game Semantics for Quantum Stores
This paper presents a game semantics for a simply-typed -calculus equipped with quantum stores. The quantum stores are equipped with quantum operations as commands which give the ...
Yannick Delbecque, Prakash Panangaden
SIAMJO
2008
112views more  SIAMJO 2008»
13 years 9 months ago
Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...
Charles Audet, J. E. Dennis, Sébastien Le D...
ACTA
2005
92views more  ACTA 2005»
13 years 9 months ago
Type-based information flow analysis for the pi-calculus
We propose a new type system for information flow analysis for the -calculus. As demonstrated by recent studies, information about whether each communication succeeds is important ...
Naoki Kobayashi