Chalmers Research: Peter Dybjer

2024

The extended predicative Mahlo universe in Martin-Lof type theory

Peter Dybjer, Anton Setzer

Journal of Logic and Computation. Vol. 34 (6), p. 1032-1063

Journal article

2023

Type Theory with Explicit Universe Polymorphism

M. Bezem, Thierry Coquand, Peter Dybjer et al

Leibniz International Proceedings in Informatics, LIPIcs. Vol. 269

Paper in proceeding

2021

On generalized algebraic theories and categories with families

Marc Bezem, Thierry Coquand, Peter Dybjer et al

Mathematical Structures in Computer Science. Vol. 31 (9), p. 1006-1023

Journal article

2021

Categories with Families: Unityped, Simply Typed, and Dependently Typed

Simon Castellan, P. Clairambault, Peter Dybjer

Outstanding Contributions to Logic. Vol. 20, p. 135-180

Book chapter

Show project

2018

Finitary Higher Inductive Types in the Groupoid Model

Peter Dybjer, Hugo Moeneclaey

Electronic Notes in Theoretical Computer Science. Vol. 336, p. 119-134

Journal article

2017

Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended Version)

Simon Castellan, Pierre Clairambault, Peter Dybjer

Logical Methods in Computer Science. Vol. 13 (4)

Journal article

2017

Special issue on Programming with Dependent Types Editorial

Wouter Swierstra, Peter Dybjer

Journal of Functional Programming. Vol. 27

Other text in scientific journal

2016

Intuitionistic Type Theory

Peter Dybjer

Other

2015

Undecidability of Equality in the Free Locally Cartesian Closed Category

Peter Dybjer, Simon Castellan, Pierre Clairambault

Leibniz International Proceedings in Informatics, LIPIcs. Vol. 38, p. 138-152

Paper in proceeding

2015

Game semantics and normalization by evaluation

P. Clairambault, Peter Dybjer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9034, p. 56-70

Paper in proceeding

2014

The biequivalence of locally cartesian closed categories and Martin-Lof type theories

P. Clairambault, Peter Dybjer

Mathematical Structures in Computer Science. Vol. 24 (6), p. Art. no. e240606-

Journal article

2012

Epistemology versus Ontology - Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf (Logic, Epistemology, and the Unity of Science: Vol. 27)

Peter Dybjer, Lindström Sten, Palmgren Erik et al

Book

2012

Program Testing and the Meaning Explanations of Intuitionistic Type Theory

Peter Dybjer

Epistemology versus Ontology - Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf, p. 215-241

Book chapter

2012

Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs

Ana Bove, Peter Dybjer, Andrés Sicard-Ramírez

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7213 LNCS, p. 104-118

Paper in proceeding

2012

Formal neighbourhoods, combinatory Bohm trees, and untyped normalization by evaluation

Peter Dybjer, D. Kuperberg

Annals of Pure and Applied Logic. Vol. 163 (2), p. 122-131

Journal article

2011

The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories

P. Clairambault, Peter Dybjer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6690, p. 91-106

Paper in proceeding

2009

Embedding a Logical Theory of Constructions in Agda

Ana Bove, Peter Dybjer, Andres Sicard-Ramirez

Proceedings of the 2009 ACM SIGPLAN Workshop on Programming Languages meets Program Verification (PLPV) 2009, p. 59-66

Paper in proceeding

2009

Dependent Types at Work

Ana Bove, Peter Dybjer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5520, p. 57-99

Paper in proceeding

2009

A Brief Overview of Agda - A Functional Language with Dependent Types

Ana Bove, Peter Dybjer, Ulf Norell

Theorem Proving in Higher Order Logics. Vol. 5674 (LNCS), p. 73--78-

Other conference contribution

2008

On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory

Andreas Abel, Thierry Coquand, Peter Dybjer

FLOPS 2008, p. 3-13

Paper in proceeding

2008

The Interpretation of Intuitionistic Type Theory in Locally Cartesian Closed Categories - an Intuitionistic Perspective

Peter Dybjer, Alexandre Buisse

Electr. Notes Theor. Comput. Sci. (218), p. 21-32

Paper in proceeding

2008

Towards Formalizing Categorical Models of Type Theory in Type Theory

Alexandre Buisse, Peter Dybjer

Electronic Notes in Theoretical Computer Science. Vol. 196 (C), p. 137-151

Journal article

2008

Verifying a semantic βη-conversion test for martin-löf type theory

Andreas Abel, Thierry Coquand, Peter Dybjer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5133 LNCS, p. 29-56

Paper in proceeding

2007

Towards formalizing categorical models of type theory in type theory

Alexandre Buisse, Peter Dybjer

Second International Workshop on Logical Frameworks and Metalanguages: Theory and Practice (LFMTP'07), eds Brigite Pientka and Carsten Schurmann, Electronic Notes in Theoretical Computer Science, Elsevier, p. 72-85

Paper in proceeding

2007

Normalization by evaluation for Martin-Löf type theory with one universe

Andreas Abel, Klaus Aehlig, Peter Dybjer

Mathematical Foundations of Programming Semantics, New Orleans, LA, USA, April 2007. Ed. M. Fiore. Electronic Notes in Theoretical Computer Science, Elsevier.. Vol. 173, p. 17-40

Paper in proceeding

2007

Normalization by Evaluation for Martin-Löf Type Theory with Equality Judgements

Andreas Abel, Thierry Coquand, Peter Dybjer

Proceedings of 22nd IEEE Annual Symposium on Logic in ComputerScience, Wroclaw, Poland, July 2007., p. 3-12

Journal article

2006

Indexed induction-recursion

Peter Dybjer, Anton Setzer

Journal of Logic and Algebraic Programming. Vol. 66 (1), p. 1-49

Journal article

2004

Introduction to the Special Issue on Dependent Type Theory Meets Practical Programming

Gilles Barthes, Peter Dybjer, Peter Thiemann

Journal of Functional Programming. Vol. 14 (1), p. 1-2

Magazine article

2004

Verifying Haskell programs by combining testing, model checking and interactive theorem proving

Peter Dybjer, Haiyan Qiao, Makoto Takeyama

Information and Software Technology. Vol. 46 (15), p. 1011 - 1025

Paper in proceeding

2004

Random generators for dependent types

Peter Dybjer, Haiyan Qiao, Makoto Takeyama

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), p. 341 -355

Paper in proceeding

2003

Combining testing and proving in dependent type theory

Peter Dybjer, Haiyan Qiao, Makoto Takeyama

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2758, p. 188-203

Paper in proceeding

2003

Verifying Haskell programs by combining testing and proving

Peter Dybjer, Haiyan Qiao, Makoto Takeyama

Proceedings 3rd International Conference on Quality Software, IEEE Computer Society Press. Vol. 2003-January, p. 272-279

Paper in proceeding

2003

Industrial Challenges in Semantics

John Hughes, Nick Benton, Peter Dybjer

Report

2003

Universes for Generic Programs and Proofs in Dependent Type Theory

Marcin Benke, Peter Dybjer, Patrik Jansson

Nordic Journal of Computing. Vol. 10 (4), p. 265-289

Journal article

2003

Induction-recursion and initial algebras

Peter Dybjer, Anton Setzer

Annals of Pure and Applied Logic. Vol. 124 (1-3), p. 1-47

Journal article

2002

Normalization and Partial Evaluation

Peter Dybjer, Andrzej Filinski

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2395, p. 137-192

Paper in proceeding

2002

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures (LNCS 2395)

Gilles Barthe, Peter Dybjer, Luis Pinto et al

Edited book

2001

Indexed induction-recursion

Peter Dybjer, Anton Setzer

Proof Theory in Computer Science · International Seminar, LNCS. Vol. 2183, p. 93-113

Paper in proceeding

2001

Normalization by evaluation for typed lambda calculus with coproducts

Thorsten Altenkirch, Peter Dybjer, Martin Hofmann et al

Proceedings of 16th Annual Symposium on Logic in Computer Science, p. 303-310

Paper in proceeding

2000

Types for Proofs and Programs - nternational Workshop, TYPES'99, Lökeberg, Sweden, June 12-16, 1999, Selected Papers (Lecture Notes in Computer Science, Vol. 1956)

Thierry Coquand, Peter Dybjer, Bengt Nordström et al

Edited book

2000

A general formulation of simultaneous inductive-recursive definitions in type theory

Peter Dybjer

Journal of Symbolic Logic. Vol. 65 (2), p. 525-549

Journal article

1999

A finite axiomatization of inductive-recursive definitions

Peter Dybjer, Anton Setzer

Proceedings of TLCA 1999, LNCS. Vol. 1581, p. 129 - 146

Paper in proceeding

1998

Normalization and the Yoneda embedding

Peter Dybjer, Djordje Cubric, Philip Scott

Mathematical Structures in Computer Science. Vol. 8, p. 153-192

Journal article

1997

Intuitionistic model constructions and normalization proofs

Peter Dybjer, Thierry Coquand

Mathematical Structures in Computer Science. Vol. 7, p. 75-94

Journal article

1997

Representing inductively defined sets by well-orderings in Martin-Löf's type theory

Peter Dybjer

Theoretical Computer Science. Vol. 176, p. 329-335

Journal article

1996

Extracting a proof of coherence for monoidal categories from a formal proof of normalization for monoids

Peter Dybjer, Ilya Beylin

TYPES '95, LNCS. Vol. 1158, p. 47-61

Paper in proceeding

1996

Internal type theory

Peter Dybjer

TYPES '95, LNCS. Vol. 1158, p. 120-134

Journal article

1996

A Comparison of HOL and ALF Formalizations of a Categorical Coherence Theorem

Peter Dybjer, Ilya Beylin, Sten Agerholm

Theorem Proving in Higher Order Logics, LNCS. Vol. 1125, p. 17-32

Paper in proceeding

1995

Types for proofs and programs: selected papers; International workshop TYPES ´94; Båstad, Sweden, June 6 -10, 1994 (Lecture Notes in Computer Science; Vol 996)

Peter Dybjer, Bengt Nordström, Jan Smith

Edited book

1994

Inductive definitions and type theory an introduction (preliminary version)

Peter Dybjer, Thierry Coquand

Foundation of Software Technology and Theoretical Computer Science: 14th Conference Madras, India; (Lecture Notes in Computer Science; 880). Vol. 880, p. 60-76

Paper in proceeding

1994

Inductive Families

Peter Dybjer

Formal Aspects of Computing. Vol. 6, p. 440-465

Journal article

1993

Intuitionistic model constructions and normalization proofs

Peter Dybjer, Thierry Coquand

Proceedings of the 1993 TYPES Workshop, Nijmegen, p. 85-109

Other conference contribution

1991

Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics

Peter Dybjer

Logical Frameworks, p. 280-306

Journal article

1991

Inverse image analysis generalises strictness analysis

Peter Dybjer

Information and Computation. Vol. 90 (2), p. 194--216-

Journal article

1990

Comparing integrated and external logics of functional programs

Peter Dybjer

Science of Computer Programming. Vol. 14, p. 59--79-

Journal article

1990

A Functional Programming Approach to the Specification and Verification of Concurrent Systems

Peter Dybjer, Herbert Sander

Specification and Verification of Concurrent Systems [BCS-FACS Workshop, 6-8 July 1988, University of Stirling, Scotland, UK]; Charles Rattray (Ed.), p. 331-343

Paper in proceeding

1989

A functional programming approach to the specification and verification of concurrent systems

Peter Dybjer, Herbert Sander

Formal Aspects of Computing. Vol. 1, p. 303-319

Journal article

1989

Category Theory and Computer Science, Manchester, UK, September 5-8, 1989, Proceedings (Lecture Notes in Computer Science; 389)

D. H. Pitt, D.E. Rydeheard, Peter Dybjer et al

Edited book

1987

Inverse Image Analysis

Peter Dybjer

Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings. Springer 1987; (Lecture Notes in Computer Science; 267). Vol. 267, p. 21-30

Paper in proceeding

1986

Category theory and programming language semantics - an overview

Peter Dybjer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 240, p. 165-181

Journal article

1985

Program Verification In A Logical Theory Of Constructions

Peter Dybjer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 201, p. 334-349

Paper in proceeding

1985

Using Domain Algebras To Prove The Correctness Of A Compiler

Peter Dybjer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 182, p. 98-108

Paper in proceeding

1984

Domain Algebras

Peter Dybjer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 172, p. 138-150

Journal article

1984

Some results on the deductive structure of join dependencies

Peter Dybjer

Theoretical Computer Science. Vol. 33 (1), p. 95-105

Journal article

1983

Towards a Unified Theory of Data Types: Some Categorical Aspects

Peter Dybjer

Proceedings 2nd Workshop on Abstract Data Type, 1983. University of Passau, Department of Computer Science, Technical Report; Manfred Broy, Martin Wirsing (Eds.)

Other conference contribution