Universal Algebra in Type Theory-Reference-Cited by-同舟云学术

Universal Algebra in Type Theory

Published:1999 Issue: Volume: Page:131-148
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Capretta Venanzio

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48256-3_10

Reference23 articles.

1. Peter Aczel. Notes towards a formalisation of constructive galois theory. draft report, 1994.

2. H. P. Barendregt. Lambda Calculi with Types. In S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 2. Oxford University Press, 1992.

3. Bruno Barras, Samuel Boutin, Cristina Cornes, Judicaël Courant, Yann Coscoy, David Delahaye, Daniel de Rauglaudre, Jean-Christophe Filliâtre, Eduardo Giménez, Hugo Herbelin, Gérard Huet, Henri Laulhère, César Muñoz, Chetan Murthy, Catherine Parent-Vigouroux, Patrick Loiseleur, Christine Paulin-Mohring, Amokrane Saïbi, and Benjanin Werner. The Coq Proof Assistant Reference Manual. Version 6.2.

4. Lect Notes Comput Sci;G. Barthe,1995

5. Lect Notes Comput Sci;S. Boutin,1997

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Unifying Logical Foundation for Initial Algebra Semantics and Induction;2024

2. Machine-Assisted Proofs for Institutions in Coq;Theoretical Aspects of Software Engineering;2022

3. Machine-Assisted Proofs for Institutions in Coq;Lecture Notes in Computer Science;2022

4. Structure-Preserving Diagram Operators;Recent Trends in Algebraic Development Techniques;2021

5. Formalizing the Institution for Event-B in the Coq Proof Assistant;Rigorous State-Based Methods;2021