2007 |
21 | EE | Silvio Valentini:
Constructive characterizations of bar subsets.
Ann. Pure Appl. Logic 145(3): 368-378 (2007) |
2005 |
20 | EE | Silvio Valentini:
The problem of the formalization of constructive topology.
Arch. Math. Log. 44(1): 115-129 (2005) |
2004 |
19 | EE | Stefano Berardi,
Silvio Valentini:
Krivine's intuitionistic proof of classical completeness (for countable languages).
Ann. Pure Appl. Logic 129(1-3): 93-106 (2004) |
18 | EE | Maria Emilia Maietti,
Silvio Valentini:
Exponentiation of Scott Formal Topologies.
Electr. Notes Theor. Comput. Sci. 73: 111-131 (2004) |
2003 |
17 | EE | Thierry Coquand,
Giovanni Sambin,
Jan M. Smith,
Silvio Valentini:
Inductively generated formal topologies.
Ann. Pure Appl. Logic 124(1-3): 71-106 (2003) |
16 | EE | Silvio Valentini,
Matteo Viale:
A binary modal logic for the intersection types of lambda-calculus.
Inf. Comput. 185(2): 211-232 (2003) |
15 | | Silvio Valentini:
A cartesian closed category in Martin-Löf's intuitionistic type theory.
Theor. Comput. Sci. 290(1): 189-219 (2003) |
2002 |
14 | EE | Silvio Valentini:
On the formal points of the formal topology of the binary tree.
Arch. Math. Log. 41(7): 603-618 (2002) |
13 | EE | Silvio Valentini:
Extensionality Versus Constructivity.
Math. Log. Q. 48(2): 179-187 (2002) |
2001 |
12 | EE | Silvio Valentini:
An elementary proof of strong normalization for intersection types.
Arch. Math. Log. 40(7): 475-488 (2001) |
1999 |
11 | | Maria Emilia Maietti,
Silvio Valentini:
Can You Add Power-Sets to Martin-Löf's Intuitionistic Set Theory?
Math. Log. Q. 45: 521-532 (1999) |
10 | | Venanzio Capretta,
Silvio Valentini:
A general method for proving the normalization theorem for first and second order typed lambda-calculi.
Mathematical Structures in Computer Science 9(6): 719-739 (1999) |
1997 |
9 | | Sara Negri,
Silvio Valentini:
Tychonoff's Theorem in the Framework of Formal Topologies.
J. Symb. Log. 62(4): 1315-1332 (1997) |
1996 |
8 | | Silvio Valentini:
Decidability in Intuitionistic Type Theory is Functionally Decidable.
Math. Log. Q. 42: 300-304 (1996) |
7 | | Dario Maguolo,
Silvio Valentini:
An Intuitionistic Version of Cantor's Theorem.
Math. Log. Q. 42: 446-448 (1996) |
6 | EE | Giovanni Sambin,
Silvio Valentini,
Paolo Virgili:
Constructive Domain Theory as a Branch of Intuitionistic Pointfree Topology.
Theor. Comput. Sci. 159(2): 319-341 (1996) |
1994 |
5 | | Silvio Valentini:
Representation Theorems for Quantales.
Math. Log. Q. 40: 182-190 (1994) |
1993 |
4 | | Giovanni Sambin,
Silvio Valentini:
Building up a Tool-Box for Matrin-Löf's Type Theory (Abstract).
Kurt Gödel Colloquium 1993: 69-70 |
3 | | Ugo Solitro,
Silvio Valentini:
Local Computation in Linear Logic.
Math. Log. Q. 39: 201-212 (1993) |
2 | | Silvio Valentini:
A Proof of the Normal Form Theorem for the Closed Terms of Girard's System F by Means of Computability.
Math. Log. Q. 39: 539-544 (1993) |
1992 |
1 | | Annalisa Bossi,
Silvio Valentini:
An Intuitionistic Theory of Types with Assumptions of High-Arity Variables.
Ann. Pure Appl. Logic 57(2): 93-149 (1992) |