Djordje Čubrić
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Djordje Čubrić has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Peter Dybjer
Department of Computing Science, Chalmers University of Technology and Göteborg University, 412 96 Göteborg, Sweden
1 shared publication - Philip Scott
School of Informatics, Indiana University
1 shared publication
Latest Publications
- 1 April 1998
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 8 (2) , 153-192
Normalization and the Yoneda embedding
We show how to solve the word problem for simply typed λβη-calculus by using a few well-known facts about categories of presheaves and the Yoneda embedding. The formal setting for these results is [Pscr ]-category theory, a version of ordinary category theory where each hom-set is equipped with a partial equivalence relation. The part of [Pscr ]-category theory we develop here is constructive and thus permits extraction of programs from proofs. It is important to stress that in our method we make no use of traditional proof-theoretic or rewriting techniques. To show the robustness of our method, we give an extended treatment for more general λ-theories in the Appendix.
- 1 April 1998
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 8 (2) , 153-192
Normalization and the Yoneda embedding
We show how to solve the word problem for simply typed λβη-calculus by using a few well-known facts about categories of presheaves and the Yoneda embedding. The formal setting for these results is [Pscr ]-category theory, a version of ordinary category theory where each hom-set is equipped with a partial equivalence relation. The part of [Pscr ]-category theory we develop here is constructive and thus permits extraction of programs from proofs. It is important to stress that in our method we make no use of traditional proof-theoretic or rewriting techniques. To show the robustness of our method, we give an extended treatment for more general λ-theories in the Appendix.
- 1 August 1994
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 33 (4) , 291-319
Interpolation property for bicartesian closed categories
- 1 August 1994
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 33 (4) , 291-319
Interpolation property for bicartesian closed categories