Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Adams, Robin - Department of Computer Science, Royal Holloway, University of London
Coercive Subtyping in LambdaFree Logical Robin Adams
Under consideration of Math. Struct. in Comp. Science Structural subtyping for inductive types
A Survey of Predicativity Robin Adams
Under consideration for publication in J. Functional Programming 1 Pure Type Systems with Judgemental Equality
Weyl's Predicative Classical Mathematics as a LogicEnriched Type Theory #
A MODULAR HIERARCHY OF LOGICAL FRAMEWORKS
Coercive Subtyping in Lambda-Free Logical Robin Adams
A Survey of Predicativity Robin Adams
Control Operators and Natural Numbers are Robin Adams
A Modular Hierarchy of Logical Frameworks Robin Adams
Coercive Subtyping in Lambda-free Logical Frameworks Robin Adams
A Formalization of the Theory of Pure Type Systems in Coq
The Consistency of Various Theories of Inductive Types
Weyl's Predicative Classical Mathematics as a Logic-Enriched Type Theory?
Inductive Types in Pure Type Systems Robin Adams
A Modular Hierarchy of Logical Frameworks Robin Adams
The Consistency of Large Elimination Robin Adams
Decidable Equality in a Logical Framework with Sigma Kinds
The Lambda-Free Core of ELF Robin Adams
Adding Logic to a PTS Robin Adams
A Formalisation of the Theory of PTSs in Coq Robin Adams
Coercive Subtyping in Lambda-Free Logical Frameworks
Founders's Building 1 Archive & Bedford Centre
Predicative Mathematics in Type Theory Robin Adams
Proof and Definition in Logic and Type Theory Proof and Definition in Logic and Type Theory
A Survey of Predicativity Robin Adams
Predicative Mathematics in Type Theory Robin Adams
Under consideration for publication in J. Functional Programming 1 Pure Type Systems with Judgemental Equality
A MODULAR HIERARCHY OF LOGICAL FRAMEWORKS
Categorical Semantics for Logic-Enriched Type Theories Robin Adams
