Sciweavers

2529 search results - page 19 / 506
» The Logical Structure of Binding
Sort
View
JAPLL
2007
113views more  JAPLL 2007»
14 years 9 months ago
Fresh Logic: proof-theory and semantics for FM and nominal techniques
In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the model of names and binding in abst...
Murdoch Gabbay
IJCAI
1989
14 years 11 months ago
Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed Backtracking
A model of unrestricted And-parallel execution for logic programs is described, based on Dependency Directed Backtracking (DDBT) aimed at improving the efficiency of execution whi...
Nikos Drakos
TLCA
2005
Springer
15 years 3 months ago
Proof Contexts with Late Binding
Abstract. The Focal language (formerly FoC) allows one to incrementally build modules and to formally prove their correctness. In this paper, we present two formal semantics for en...
Virgile Prevosto, Sylvain Boulmé
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 9 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
IANDC
2010
102views more  IANDC 2010»
14 years 8 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan