Sciweavers

481 search results - page 20 / 97
» Executing Higher Order Logic
Sort
View
ESOP
2009
Springer
14 years 1 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
TLCA
2007
Springer
14 years 4 months ago
Two Session Typing Systems for Higher-Order Mobile Processes
Abstract. This paper proposes two typing systems for session interactions in higherorder mobile processes. Session types for the HOπ-calculus capture high-level structures nicatio...
Dimitris Mostrous, Nobuko Yoshida
CSL
2008
Springer
13 years 11 months ago
Syntactic Metatheory of Higher-Order Subtyping
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
Andreas Abel, Dulma Rodriguez
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 10 months ago
Sound Bisimulations for Higher-Order Distributed Process Calculus
Abstract. While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we develop a bis...
Adrien Piérard, Eijiro Sumii
LICS
2007
IEEE
14 years 4 months ago
Environmental Bisimulations for Higher-Order Languages
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...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii