P. Dybjer

发表

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

P. Dybjer, 1991 .

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, Jan M. Smith, 2000 .

Type Theories with Universe Level Judgments

T. Coquand, M. Bezem, P. Dybjer, 2022 .

On the Syntax of Dependent Types and the Coherence Problem (working Draft)

P. Dybjer, 1994 .

ProgrmaYerification in a l~gical Theory of Constructions

P. Dybjer, E. Ax, 2005 .

Category Theory and Computer Science

Andrew M. Pitts, Peter Dybjer, David E. Rydeheard, 1987, Lecture Notes in Computer Science.

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

Ulf Norell, Peter Dybjer, Ana Bove, 2009, TPHOLs.

Using Domain Algebras to Prove the Correctness of a Compiler

Peter Dybjer, P. Dybjer, 1985, STACS.

Domain Algebras

Peter Dybjer, P. Dybjer, 1984, ICALP.

Intuitionistic Type Theory

Peter Dybjer, Erik Palmgren, P. Dybjer, 2016 .

Dependent Types at Work

Peter Dybjer, Ana Bove, P. Dybjer, 2009, LerNet ALFA Summer School.

Inductive families

Peter Dybjer, P. Dybjer, 2005, Formal Aspects of Computing.

Program Testing and the Meaning Explanations of Intuitionistic Type Theory

Peter Dybjer, P. Dybjer, 2012, Epistemology versus Ontology.

Metalanguages and Applications

Andrew M. Pitts, Peter Dybjer, Eugenio Moggi, 1997 .

Inverse Image Analysis

Peter Dybjer, P. Dybjer, 1987, ICALP.

Induction-recursion and initial algebras

Peter Dybjer, Anton Setzer, P. Dybjer, 2003, Ann. Pure Appl. Log..

Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements

Thierry Coquand, Peter Dybjer, Andreas Abel, 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

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

Peter Dybjer, P. Dybjer, 2000, Journal of Symbolic Logic.

Inverse Image Analysis Generalises Strictness Analysis

Peter Dybjer, P. Dybjer, 1991, Inf. Comput..

Internal Type Theory

Peter Dybjer, P. Dybjer, 1995, TYPES.

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

Peter Dybjer, Herbert P. Sander, P. Dybjer, 1988, Formal Aspects of Computing.

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

Peter Dybjer, Pierre Clairambault, Simon Castellan, 2019, ArXiv.

Intuitionistic model constructions and normalization proofs

Thierry Coquand, Peter Dybjer, T. Coquand, 1997, Mathematical Structures in Computer Science.

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

João Saraiva, Gilles Barthe, Peter Dybjer, 2000 .

Normalization and Partial Evaluation

Peter Dybjer, Andrzej Filinski, Andrzej Filinski, 2000, APPSEM.

Representing Inductively Defined Sets by Wellorderings in Martin-Löf's Type Theory

Peter Dybjer, P. Dybjer, 1997, Theor. Comput. Sci..

On generalized algebraic theories and categories with families pdf

Thierry Coquand, Peter Dybjer, Marc Bezem, 2020, Mathematical Structures in Computer Science.

A Schema for Higher Inductive Types of Level One and Its Interpretation

Peter Dybjer, Hugo Moeneclaey, P. Dybjer, 2016 .

Universes for Generic Programs and Proofs in Dependent Type Theory

Peter Dybjer, Patrik Jansson, Marcin Benke, 2003, Nord. J. Comput..

Verifying Haskell programs by combining testing and proving

Peter Dybjer, Makoto Takeyama, Qiao Haiyan, 2003, Third International Conference on Quality Software, 2003. Proceedings..

Category Theory and Programming Language Semantics: an Overview

Peter Dybjer, P. Dybjer, 1985, CTCS.

Finitary Higher Inductive Types in the Groupoid Model

Peter Dybjer, Hugo Moeneclaey, P. Dybjer, 2018, MFPS.

Embedding a logical theory of constructions in Agda

Peter Dybjer, Ana Bove, Andrés Sicard-Ramírez, 2009, PLPV '09.

Indexed induction-recursion

Peter Dybjer, Anton Setzer, P. Dybjer, 2001, J. Log. Algebraic Methods Program..

A Finite Axiomatization of Inductive-Recursive Definitions

Peter Dybjer, Anton Setzer, P. Dybjer, 1999, TLCA.

Extracting a Proof of Coherence for Monoidal Categories from a Proof of Normalization for Monoids

Peter Dybjer, Ilya Beylin, P. Dybjer, 1995, TYPES.

Towards Formalizing Categorical Models of Type Theory in Type Theory

Peter Dybjer, Alexandre Buisse, P. Dybjer, 2007, LFMTP@CADE.

Finite Axiomatizations of Inductive and Inductive-Recursive Definitions

Peter Dybjer, P. Dybjer, 1998 .

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

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

Comparing Integrated and External Logics of Functional Programs

Peter Dybjer, P. Dybjer, 1990, Sci. Comput. Program..

Program Verification in a Logical Theory of Constructions

Peter Dybjer, P. Dybjer, 1985, FPCA.

Inductive Definitions and Type Theory: an Introduction (Preliminary Version)

Thierry Coquand, Peter Dybjer, T. Coquand, 1994, FSTTCS.

Normalization by evaluation for typed lambda calculus with coproducts

Martin Hofmann, Thorsten Altenkirch, Peter Dybjer, 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.