Peter Dybjer

Orcid: 0000-0003-4043-5204

Affiliations:
  • Chalmers University of Technology, Gothenburg, Sweden


According to our database1, Peter Dybjer authored at least 55 papers between 1983 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The extended predicative Mahlo universe in Martin-Löf type theory.
J. Log. Comput., 2024

2022
Type Theories with Universe Level Judgements.
CoRR, 2022

Type Theory with Explicit Universe Polymorphism.
Proceedings of the 28th International Conference on Types for Proofs and Programs, 2022

2021
On generalized algebraic theories and categories with families.
Math. Struct. Comput. Sci., 2021

2020
A Note on Generalized Algebraic Theories and Categories with Families.
CoRR, 2020

2019
Categories with Families: Unityped, Simply Typed, and Dependently Typed.
CoRR, 2019

2018
Finitary Higher Inductive Types in the Groupoid Model.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

2017
Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version).
Log. Methods Comput. Sci., 2017

Special issue on Programming with Dependent Types Editorial.
J. Funct. Program., 2017

2015
Undecidability of Equality in the Free Locally Cartesian Closed Category.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

Game Semantics and Normalization by Evaluation.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014
The biequivalence of locally cartesian closed categories and Martin-Löf type theories.
Math. Struct. Comput. Sci., 2014

2012
Program Testing and the Meaning Explanations of Intuitionistic Type Theory.
Proceedings of the Epistemology versus Ontology, 2012

Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation.
Ann. Pure Appl. Log., 2012

Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011
Agda Implementors Meeting (NII Shonan Meeting 2011-2).
NII Shonan Meet. Rep., 2011

2009
A Brief Overview of Agda - A Functional Language with Dependent Types.
Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009

Embedding a logical theory of constructions in Agda.
Proceedings of the 3rd ACM Workshop Programming Languages meets Program Verification, 2009

2008
The Interpretation of Intuitionistic Type Theory in Locally Cartesian Closed Categories - an Intuitionistic Perspective.
Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, 2008

Verifying a Semantic beta-eta-Conversion Test for Martin-Löf Type Theory.
Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008

Dependent Types at Work.
Proceedings of the Language Engineering and Rigorous Software Development, International LerNet ALFA Summer School 2008, Piriapolis, Uruguay, February 24, 2008

On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory.
Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

2007
Towards Formalizing Categorical Models of Type Theory in Type Theory.
Proceedings of the Second International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2007

Normalization by Evaluation for Martin-Löf Type Theory with One Universe.
Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007

Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006
Indexed induction-recursion.
J. Log. Algebraic Methods Program., 2006

2004
Introduction to the Special Issue on Dependent Type Theory Meets Practical Programming.
J. Funct. Program., 2004

Verifying Haskell programs by combining testing, model checking and interactive theorem proving.
Inf. Softw. Technol., 2004

Random Generators for Dependent Types.
Proceedings of the Theoretical Aspects of Computing, 2004

2003
Universes for Generic Programs and Proofs in Dependent Type Theory.
Nord. J. Comput., 2003

Induction-recursion and initial algebras.
Ann. Pure Appl. Log., 2003

Combining Testing and Proving in Dependent Type Theory.
Proceedings of the Theorem Proving in Higher Order Logics, 16th International Conference, 2003

Verifying Haskell Programs by Combining Testing and Proving.
Proceedings of the 3rd International Conference on Quality Software (QSIC 2003), 2003

2001
Normalization by Evaluation for Typed Lambda Calculus with Coproducts.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

2000
A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory.
J. Symb. Log., 2000

Normalization and Partial Evaluation.
Proceedings of the Applied Semantics, International Summer School, 2000

1999
A Finite Axiomatization of Inductive-Recursive Definitions.
Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

1998
Normalization and the Yoneda Embedding.
Math. Struct. Comput. Sci., 1998

1997
Representing Inductively Defined Sets by Wellorderings in Martin-Löf's Type Theory.
Theor. Comput. Sci., 1997

Intuitionistic Model Constructions and Normalization Proofs.
Math. Struct. Comput. Sci., 1997

1996
A Comparison of HOL and ALF Formalizations of a Categorical Coherence Theorem.
Proceedings of the Theorem Proving in Higher Order Logics, 9th International Conference, 1996

1995
Internal Type Theory.
Proceedings of the Types for Proofs and Programs, 1995

Extracting a Proof of Coherence for Monoidal Categories from a Proof of Normalization for Monoids.
Proceedings of the Types for Proofs and Programs, 1995

1994
Inductive Families.
Formal Aspects Comput., 1994

Inductive Definitions and Type Theory: an Introduction (Preliminary Version).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1991
Inverse Image Analysis Generalises Strictness Analysis
Inf. Comput., February, 1991

1990
Comparing Integrated and External Logics of Functional Programs.
Sci. Comput. Program., 1990

1989
A Functional Programming Approach to the Specification and Verification of Concurrent Systems.
Formal Aspects Comput., 1989

1987
Inverse Image Analysis.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1985
Using Domain Algebras to Prove the Correctness of a Compiler.
Proceedings of the STACS 85, 1985

Program Verification in a Logical Theory of Constructions.
Proceedings of the Functional Programming Languages and Computer Architecture, 1985

Category Theory and Programming Language Semantics: an Overview.
Proceedings of the Category Theory and Computer Programming, 1985

1984
Some Results on the Deductive Structure of Join Dependencies.
Theor. Comput. Sci., 1984

Domain Algebras.
Proceedings of the Automata, 1984

1983
Towards a Unified Theory of Data Types: Some Categorical Aspects.
Proceedings of the Proceedings 2nd Workshop on Abstract Data Type, 1983


  Loading...