The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter Dybjer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Dybjer
    Domain Algebras. [Citation Graph (1, 0)][DBLP]
    ICALP, 1984, pp:138-150 [Conf]
  2. Peter Dybjer, Andrzej Filinski
    Normalization and Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    APPSEM, 2000, pp:137-192 [Conf]
  3. Peter Dybjer
    Towards a Unified Theory of Data Types: Some Categorical Aspects. [Citation Graph (0, 0)][DBLP]
    ADT, 1983, pp:- [Conf]
  4. Peter Dybjer
    Category Theory and Programming Language Semantics: an Overview. [Citation Graph (0, 0)][DBLP]
    CTCS, 1985, pp:165-181 [Conf]
  5. Peter Dybjer, Anton Setzer
    Indexed Induction-Recursion. [Citation Graph (0, 0)][DBLP]
    Proof Theory in Computer Science, 2001, pp:93-113 [Conf]
  6. Peter Dybjer, Herbert P. Sander
    A Functional Programming Approach to the Specification and Verification of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Specification and Verification of Concurrent Systems, 1988, pp:331-343 [Conf]
  7. Peter Dybjer
    Program Verification in a Logical Theory of Constructions. [Citation Graph (0, 0)][DBLP]
    FPCA, 1985, pp:334-349 [Conf]
  8. Thierry Coquand, Peter Dybjer
    Inductive Definitions and Type Theory: an Introduction (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:60-76 [Conf]
  9. Peter Dybjer
    Inverse Image Analysis. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:21-30 [Conf]
  10. Peter Dybjer, Qiao Haiyan, Makoto Takeyama
    Random Generators for Dependent Types. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2004, pp:341-355 [Conf]
  11. Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, Philip J. Scott
    Normalization by Evaluation for Typed Lambda Calculus with Coproducts. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:303-310 [Conf]
  12. Peter Dybjer, Qiao Haiyan, Makoto Takeyama
    Verifying Haskell Programs by Combining Testing and Proving. [Citation Graph (0, 0)][DBLP]
    QSIC, 2003, pp:272-279 [Conf]
  13. Peter Dybjer
    Using Domain Algebras to Prove the Correctness of a Compiler. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:98-108 [Conf]
  14. Peter Dybjer, Anton Setzer
    A Finite Axiomatization of Inductive-Recursive Definitions. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:129-146 [Conf]
  15. Sten Agerholm, Ilya Beylin, Peter Dybjer
    A Comparison of HOL and ALF Formalizations of a Categorical Coherence Theorem. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1996, pp:17-32 [Conf]
  16. Peter Dybjer, Qiao Haiyan, Makoto Takeyama
    Combining Testing and Proving in Dependent Type Theory. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2003, pp:188-203 [Conf]
  17. Peter Dybjer
    Internal Type Theory. [Citation Graph (0, 0)][DBLP]
    TYPES, 1995, pp:120-134 [Conf]
  18. Ilya Beylin, Peter Dybjer
    Extracting a Proof of Coherence for Monoidal Categories from a Proof of Normalization for Monoids. [Citation Graph (0, 0)][DBLP]
    TYPES, 1995, pp:47-61 [Conf]
  19. Peter Dybjer, Anton Setzer
    Induction-recursion and initial algebras. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2003, v:124, n:1-3, pp:1-47 [Journal]
  20. Andreas Abel, Klaus Aehlig, Peter Dybjer
    Normalization by Evaluation for Martin-Löf Type Theory with One Universe. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:173, n:, pp:17-39 [Journal]
  21. Peter Dybjer
    Inductive Families. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1994, v:6, n:4, pp:440-465 [Journal]
  22. Peter Dybjer, Herbert P. Sander
    A Functional Programming Approach to the Specification and Verification of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1989, v:1, n:4, pp:303-319 [Journal]
  23. Peter Dybjer
    Inverse Image Analysis Generalises Strictness Analysis [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:90, n:2, pp:194-216 [Journal]
  24. Peter Dybjer, Qiao Haiyan, Makoto Takeyama
    Verifying Haskell programs by combining testing, model checking and interactive theorem proving. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2004, v:46, n:15, pp:1011-1025 [Journal]
  25. Gilles Barthe, Peter Dybjer, Peter Thiemann
    Introduction to the Special Issue on Dependent Type Theory Meets Practical Programming. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2004, v:14, n:1, pp:1-2 [Journal]
  26. Peter Dybjer, Anton Setzer
    Indexed induction-recursion. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2006, v:66, n:1, pp:1-49 [Journal]
  27. Peter Dybjer
    A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:2, pp:525-549 [Journal]
  28. Thierry Coquand, Peter Dybjer
    Intuitionistic Model Constructions and Normalization Proofs. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1997, v:7, n:1, pp:75-94 [Journal]
  29. Djordje Cubric, Peter Dybjer, Philip J. Scott
    Normalization and the Yoneda Embedding. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1998, v:8, n:2, pp:153-192 [Journal]
  30. Marcin Benke, Peter Dybjer, Patrik Jansson
    Universes for Generic Programs and Proofs in Dependent Type Theory. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:4, pp:265-289 [Journal]
  31. Peter Dybjer
    Comparing Integrated and External Logics of Functional Programs. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1990, v:14, n:1, pp:59-79 [Journal]
  32. Peter Dybjer
    Some Results on the Deductive Structure of Join Dependencies. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:95-105 [Journal]
  33. Peter Dybjer
    Representing Inductively Defined Sets by Wellorderings in Martin-Löf's Type Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:176, n:1-2, pp:329-335 [Journal]
  34. Andreas Abel, Thierry Coquand, Peter Dybjer
    Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:3-12 [Conf]

  35. On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory. [Citation Graph (, )][DBLP]


  36. Verifying a Semantic beta-eta-Conversion Test for Martin-Löf Type Theory. [Citation Graph (, )][DBLP]


  37. A Brief Overview of Agda - A Functional Language with Dependent Types. [Citation Graph (, )][DBLP]


  38. Embedding a logical theory of constructions in Agda. [Citation Graph (, )][DBLP]


  39. Dependent Types at Work. [Citation Graph (, )][DBLP]


  40. Towards Formalizing Categorical Models of Type Theory in Type Theory. [Citation Graph (, )][DBLP]


  41. The Interpretation of Intuitionistic Type Theory in Locally Cartesian Closed Categories - an Intuitionistic Perspective. [Citation Graph (, )][DBLP]


Search in 0.280secs, Finished in 0.282secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002