Peter Dybjer
Visar 65 publikationer
Type Theory with Explicit Universe Polymorphism
The extended predicative Mahlo universe in Martin-Lof type theory
On generalized algebraic theories and categories with families
Categories with Families: Unityped, Simply Typed, and Dependently Typed
Finitary Higher Inductive Types in the Groupoid Model
Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended Version)
Special issue on Programming with Dependent Types Editorial
Undecidability of Equality in the Free Locally Cartesian Closed Category
Game semantics and normalization by evaluation
The biequivalence of locally cartesian closed categories and Martin-Lof type theories
Program Testing and the Meaning Explanations of Intuitionistic Type Theory
Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs
Formal neighbourhoods, combinatory Bohm trees, and untyped normalization by evaluation
The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories
Embedding a Logical Theory of Constructions in Agda
A Brief Overview of Agda - A Functional Language with Dependent Types
On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory
Towards Formalizing Categorical Models of Type Theory in Type Theory
Verifying a semantic βη-conversion test for martin-löf type theory
Towards formalizing categorical models of type theory in type theory
Normalization by evaluation for Martin-Löf type theory with one universe
Normalization by Evaluation for Martin-Löf Type Theory with Equality Judgements
Introduction to the Special Issue on Dependent Type Theory Meets Practical Programming
Random generators for dependent types
Verifying Haskell programs by combining testing, model checking and interactive theorem proving
Combining testing and proving in dependent type theory
Verifying Haskell programs by combining testing and proving
Universes for Generic Programs and Proofs in Dependent Type Theory
Induction-recursion and initial algebras
Normalization and Partial Evaluation
Normalization by evaluation for typed lambda calculus with coproducts
A general formulation of simultaneous inductive-recursive definitions in type theory
A finite axiomatization of inductive-recursive definitions
Normalization and the Yoneda embedding
Intuitionistic model constructions and normalization proofs
Representing inductively defined sets by well-orderings in Martin-Löf's type theory
A Comparison of HOL and ALF Formalizations of a Categorical Coherence Theorem
Inductive definitions and type theory an introduction (preliminary version)
Intuitionistic model constructions and normalization proofs
Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics
Inverse image analysis generalises strictness analysis
Comparing integrated and external logics of functional programs
A Functional Programming Approach to the Specification and Verification of Concurrent Systems
A functional programming approach to the specification and verification of concurrent systems
Category theory and programming language semantics - an overview
Program Verification In A Logical Theory Of Constructions
Using Domain Algebras To Prove The Correctness Of A Compiler
Some results on the deductive structure of join dependencies
Towards a Unified Theory of Data Types: Some Categorical Aspects
Ladda ner publikationslistor
Du kan ladda ner denna lista till din dator.
Filtrera och ladda ner publikationslista
Som inloggad användare hittar du ytterligare funktioner i MyResearch.
Du kan även exportera direkt till Zotero eller Mendeley genom webbläsarplugins. Dessa hittar du här:
Zotero Connector
Mendeley Web Importer
Tjänsten SwePub erbjuder uttag av Researchs listor i andra format, till exempel kan du få uttag av publikationer enligt Harvard och Oxford i .RIS, BibTex och RefWorks-format.