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