In this paper we are concerned with understanding the nature of program
...
We introduce a new bounded theory RS^1_2 and show that the functions whi...
We explore the possibility of extending Mardare et al. quantitative alge...
We show that an intuitionistic version of counting propositional logic
c...
A central problem in proof-theory is that of finding criteria for identi...
We explore a quantitative interpretation of 2-dimensional intuitionistic...
Due to the undecidability of most type-related properties of System F li...
Generalized metrics, arising from Lawvere's view of metric spaces as enr...
We study the logic obtained by endowing the language of first-order
arit...
We study counting propositional logic as an extension of propositional l...
In this paper (which is a prosecution of "The naturality of natural
dedu...
We study two decidable fragments of System F, the polynomial and the Yon...
Many applications of denotational semantics, such as higher-order model
...
Proof nets provide permutation-independent representations of proofs and...
Instantiation overflow is the property of those second order types for w...
A general approach to the realizability semantics of System F is obtaine...
The investigations on higher-order type theories and on the related noti...