Name
Papers
Collaborators
PETER DYBJER
45
37
Citations 
PageRank 
Referers 
540
76.99
572
Referees 
References 
263
358
Search Limit
100572
Title
Citations
PageRank
Year
24th International Conference on Types for Proofs and Programs, TYPES 2018, June 18-21, 2018, Braga, Portugal.00.342019
Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version).10.372017
Special issue on Programming with Dependent Types Editorial.00.342017
Game Semantics and Normalization by Evaluation.00.342015
Combining interactive and automatic reasoning in first order theories of functional programs30.402012
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation.20.382012
Agda Implementors Meeting (NII Shonan Meeting 2011-2).00.342011
The biequivalence of locally cartesian closed categories and Martin-Löf type theories.40.672011
Embedding a logical theory of constructions in Agda30.392009
A Brief Overview of Agda --- A Functional Language with Dependent Types772.642009
On the algebraic foundation of proof assistants for intuitionistic type theory40.522008
Towards Formalizing Categorical Models of Type Theory in Type Theory80.682008
The Interpretation of Intuitionistic Type Theory in Locally Cartesian Closed Categories -- an Intuitionistic Perspective20.472008
Verifying a Semantic beta-eta-Conversion Test for Martin-Löf Type Theory20.472008
Dependent Types at Work161.352008
Normalization by Evaluation for Martin-Löf Type Theory with One Universe70.582007
Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements151.022007
Indexed induction–recursion181.402006
Verifying Haskell programs by combining testing, model checking and interactive theorem proving80.532004
Introduction to the Special Issue on Dependent Type Theory Meets Practical Programming00.342004
Random generators for dependent types10.362004
Combining Testing and Proving in Dependent Type Theory261.312003
Universes for generic programs and proofs in dependent type theory422.092003
Induction–recursion and initial algebras181.282003
Verifying Haskell Programs by Combining Testing and Proving40.492003
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures70.592002
A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory232.552000
Types for Proofs and Programs, International Workshop TYPES'99, Lökeberg, Sweden, June 12-16, 1999, Selected Papers101.452000
Normalization and Partial Evaluation190.992000
Normalization and the Yoneda embedding221.741998
Intuitionistic model constructions and normalization proofs485.421997
Representing inductively defined sets by wellorderings in Martin-Löf's type theory162.291997
A Comparison of HOL and ALF Formalizations of a Categorical Coherence Theorem20.811996
Extracting a Proof of Coherence for Monoidal Categories from a Proof of Normalization for Monoids121.771995
Internal Type Theory273.671995
Types for Proofs and Programs, International Workshop TYPES'94, Båstad, Sweden, June 6-10, 1994, Selected Papers113.571995
Inductive Families232.631994
Inductive Definitions and Type Theory: an Introduction (Preliminary Version)60.531994
Inverse image analysis generalises strictness analysis150.971991
Category Theory and Computer Science, Manchester, UK, September 5-8, 1989, Proceedings2224.831989
Program verification in a logical theory of construction112.091985
Category Theory and Programming Language Semantics: an Overview20.411985
Domain Algebras20.951984
Some Results On The Deductive Structure Of Join Dependencies00.341984
Towards a Unified Theory of Data Types: Some Categorical Aspects10.341983