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

Article: Nominal Equational Logic
[Show abstract] [Hide abstract]
ABSTRACT: This paper studies the notion of “freshness” that often occurs in the metatheory of computer science languages involving various kinds of names. Nominal Equational Logic is an extension of ordinary equational logic with assertions about the freshness of names. It is shown to be both sound and complete for the support interpretation of freshness and equality provided by the GabbayPitts nominal sets model of names, binding and αconversion.Electronic Notes in Theoretical Computer Science 04/2007; 
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  [Show abstract] [Hide abstract]
ABSTRACT: We present a logical framework based on the nominal approach to representing syntax with binders. First we extend nominal terms, which have a builtin nameabstraction operator and a firstorder notion of substitution for variables, with a captureavoiding substitution operator for names. We then build a dependent type system for this extended syntax and show how it can be used to formalise systems with binding operators.
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.