Peter Dybjer

From MaRDI portal
Person:651314

Available identifiers

zbMath Open dybjer.peterMaRDI QIDQ651314

List of research outcomes





PublicationDate of PublicationType
Type theory with explicit universe polymorphism2024-11-26Paper
The extended predicative Mahlo universe in Martin-Löf type theory2024-11-12Paper
A comparison of HOL and ALF formalizations of a categorical coherence theorem2024-07-05Paper
On generalized algebraic theories and categories with families2022-06-24Paper
Finitary higher inductive types in the groupoid model2022-04-25Paper
Categories with Families: Unityped, Simply Typed, and Dependently Typed2021-12-08Paper
A Note on Generalized Algebraic Theories and Categories with Families2020-12-15Paper
Internal type theory2019-01-15Paper
Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids2019-01-15Paper
https://portal.mardi4nfdi.de/entity/Q45968012017-12-11Paper
https://portal.mardi4nfdi.de/entity/Q52778362017-07-12Paper
The biequivalence of locally cartesian closed categories and Martin-Löf type theories2016-07-26Paper
Game Semantics and Normalization by Evaluation2015-10-01Paper
Normalization by Evaluation for Martin-Löf Type Theory with One Universe2015-07-10Paper
Program Testing and the Meaning Explanations of Intuitionistic Type Theory2015-06-05Paper
The Interpretation of Intuitionistic Type Theory in Locally Cartesian Closed Categories – an Intuitionistic Perspective2014-05-13Paper
Towards formalizing categorical models of type theory in type theory2014-01-10Paper
Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs2012-06-22Paper
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation2011-12-12Paper
The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories2011-06-17Paper
A Brief Overview of Agda – A Functional Language with Dependent Types2009-10-20Paper
Dependent Types at Work2009-07-28Paper
Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory2008-08-28Paper
On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory2008-04-11Paper
Indexed induction-recursion2005-12-22Paper
Theoretical Aspects of Computing - ICTAC 20042005-11-30Paper
https://portal.mardi4nfdi.de/entity/Q48255422004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q48132242004-08-13Paper
https://portal.mardi4nfdi.de/entity/Q44704922004-07-01Paper
Induction-recursion and initial algebras.2003-11-25Paper
https://portal.mardi4nfdi.de/entity/Q44360292003-11-23Paper
A general formulation of simultaneous inductive-recursive definitions in type theory2000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q42638671999-09-22Paper
Normalization and the Yoneda embedding1999-08-17Paper
Representing inductively defined sets by wellorderings in Martin-Löf's type theory1998-07-27Paper
Intuitionistic model constructions and normalization proofs1998-03-23Paper
Inductive families1994-10-26Paper
https://portal.mardi4nfdi.de/entity/Q40128831992-09-27Paper
Inverse image analysis generalises strictness analysis1991-01-01Paper
Comparing integrated and external logics of functional programs1990-01-01Paper
A functional programming approach to the specification and verification of concurrent systems1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37616741987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37573691986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36851731985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36771481985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32161221984-01-01Paper
Some results on the deductive structure of join dependencies1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33419501982-01-01Paper

Research outcomes over time

This page was built for person: Peter Dybjer