Conference Paper
A Dependent Type Theory with Names and Binding.
DOI: 10.1007/b100120 Conference: Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 2024, 2004, Proceedings
Source: DBLP

Conference Paper: Nominal Domain Theory for Concurrency.
[Show abstract] [Hide abstract]
ABSTRACT: This paper investigates a methodology of using FM (Fraenkel Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a domain theory for con currency within FM sets the domain theory inherits types and operations for name generation, essentially without disturbing its original higher order features. The original domain theory had a metalanguage HOPLA (Higher Order Process Language) and accordingly this expands to a met alanguage, Nominal HOPLA, with name generation (closely related to an earlier language newHOPLA). Nominal HOPLA possesses an oper ational and denotational semantics which are related via soundness and adequacy results, again carried out within FM sets.Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 711, 2009. Proceedings; 01/2009  [Show abstract] [Hide abstract]
ABSTRACT: Graph transformation has been used to model concurrent systems in software engineering, as well as in biochemistry and life sciences. The application of a transformation rule can be characterised algebraically as construction of a doublepushout (DPO) diagram in the category of graphs. We show how intuitionistic linear logic can be extended with resourcebound quantification, allowing for an implicit handling of the DPO conditions, and how resource logic can be used to reason about graph transformation systems.Electronic Proceedings in Theoretical Computer Science. 01/2010; 
Article: Linear Types and Locality
[Show abstract] [Hide abstract]
ABSTRACT: We introduce a system of linear dependent types, extended with quantifiers that ensure separation between distinct bound variables. Such variables may be interpreted as resources that can be accessed only locally. The main motivation for this system, is to make more manageable the logic encoding of specification formalisms based on graphs and statetransition models. The proof system is based on a sequent calculus presentation of quantified intuitionistic linear logic, relying on doubleentry sequents. We prove the admissibility of cut, and show that this result can be used to prove subject reduction.Journal of Logic and Computation 01/2014; Volume 24(Issue 3):Pages 655685. · 0.65 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.