Paper Info
Title
Basic theory of F-bounded quantification
Abstract
System F-bounded is a second order typed lambda calculus, wherethe basic features of object-oriented languages can be naturally modelled.F-bounded extends the better known system F , in a way that provides animmediate solution for the treatment of the so-called "binary methods". Althoughmore powerful than F and also quite natural, system F-bounded hasonly been superficially studied from a foundational perspective and many ofits essential properties have been conjectured but never...
Year
DOI
Venue
1999
10.1006/inco.1999.2802
Inf. Comput.
Keywords
Field
DocType
basic theory,f-bounded quantification,object oriented language,second order,typed lambda calculus
Lambda calculus,Equivalence relation,Typed lambda calculus,Algebra,Subject reduction,Bounded quantification,System F,Completeness (statistics),Mathematics,Transitive relation
Journal
Volume
Issue
ISSN
153
2
Information and Computation
Citations 
PageRank 
References 
4
0.50
31
Authors
3
Name
Order
Citations
PageRank
Paolo Baldan169651.95
Giorgio Ghelli21300255.19
Alessandra Raffaetà318716.45