-
A Generic Object-Calculus Based on Addressed Term Rewriting Systems
We describe the foundations of Obj^+a, a framework, or generic calculus, for modeling object-oriented programming languages. This framework provides a setting for a... -
A Finite First-Order Presentation of Set Theory
We present a first-order formalization of set theory which has a finite number of axioms. Its syntax is similar to that often used in textbooks: it provides an... -
A journey through resource control lambda calculi and explicit substitution u...
In this paper we invite the reader to a journey through three lambda calculi with resource control: the lambda calculus, the sequent lambda calculus, and the lambda... -
Nested Deduction in Logical Foundations for Computation
This thesis investigates the use of deep inference formalisms as basis for a computational interpretation of proof systems, following the two main approaches:... -
$\rho$-Calculus. Its Syntax and Basic Properties
Rapport interne.
