Pollack, Randy - Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh

• A Canonical Locally Named Representation of Binding A Canonical 1
• Combining Higher-Order Abstract Syntax with First-Order Abstract Syntax in ATS
• Engineering Formal Metatheory Brian Aydemir
• 0.1 Record Types The Record command of lego gives an easy syntax for declaring ``record types'',
• How to Believe a MachineChecked Proof 1 Robert Pollack
• Closure Under AlphaConversion ? ?? Randy Pollack
• Incremental Changes in LEGO: 1994 Randy Pollack
• Reasoning About CBV Functional Programs in Isabelle/HOL
• A Canonical Locally Named Representation of Binding A Canonical 1
• The Constructive Engine The Constructive Engine
• Invited Talk Towards a Type Theory of Contexts
• A Formal Treatment of the Barendregt Variable Convention in Rule Extended Abstract
• Translating Specifications from Nominal Logic to CIC with the Theory of Contexts
• The Theory of LEGO A Proof Checker for the
• Some Lambda Calculus and Type Theory Formalized James McKinna
• Incremental Changes in LEGO: 1993 Randy Pollack and Claire Jones
• A Canonical Local Representation of Binding A Canonical 1
• Some Recent Logical Frameworks Some Recent Logical Frameworks
• Strong Induction Principles in the Locally Nameless Representation of Binders
• Checking Algorithms for Pure Type Systems ??? L.S. van Benthem Jutting 1 , J. McKinna 2 and R. Pollack 2
• A Computational Approach to Reflective Meta-Reasoning about Languages with Bindings
• Modules as Dependently Typed Records Thierry Coquand
• On Extensibility of Proof Checkers ? ?? Robert Pollack
• Theories in Type Theory Randy Pollack
• Pure Type Systems Formalized James McKinna
• Types with Semantics Soundness Proof Assistant
• A Canonical Locally Named Representation of Binding A Canonical 1
• MILT is normalizing (Tait computability method)
• A Unified Category-Theoretic Formulation of Typed Binding Miki Tanaka
• A Canonical Local Representation of Binding A Canonical 1
• Local Representations of Binding Local Representations of Binding
• Programming with Dependent Types: Randy Pollack
• Proof Planning in Isabelle and Beyond Lucas Dixon
• Type Checking with Universes Robert Harper \Lambda
• Names, Binding and Substitution Randy Pollack
• Editorial Manager(tm) for Journal of Automated Reasoning Manuscript Draft
• Pure Type Systems Formalized \Lambday James McKinna
• Polishing Up the Tait--MartinLof Proof of the Church--Rosser Theorem
• A Canonical Locally Named Representation of Binding A Canonical 1
• J Autom Reasoning DOI 10.1007/s10817-011-9229-y
• A Verified Typechecker ? ?? Robert Pollack
• Fundamenta Informaticae XX (2005) 122 1 A Logical Framework with Dependently Typed Records
• Robin and Rod Birthday Celebration 1 | Rod Burstall's Work |
• Typechecking in Pure Type Systems Randy Pollack
• LEGO Proof Development System: User's Manual Zhaohui Luo Robert Pollack
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
• Some Lambda Calculus and Type Theory Formalized James McKinna
• Fundamenta Informaticae XX (2005) 1--22 1 A Logical Framework with Dependently Typed Records #
• A Canonical Locally Named Representation of Binding Randy Pollack
• Reasoning About CBV Functional Programs in Isabelle/HOL ? ??
• Under consideration for publication in Formal Aspects of Computing Dependently Typed Records
• A Bibliography About Formalized Binding Randy Pollack