Analysis of a guard condition in type theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1378, Issue , 1998, Pages 48-62

  Amadio, Roberto M ^a   Coupet Grimal, Solange ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SYNTACTICS;

DIGITAL TRANSDUCERS; INDUCTIVE-TYPE; PARTIAL EQUIVALENCE RELATIONS; RECURSIVE DEFINITIONS; REWRITING SYSTEMS; STRONG NORMALIZATION; SUBJECT REDUCTION; SYNTACTIC PROPERTIES;

COMPUTATION THEORY;

EID: 84947912701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053541     Document Type: Conference Paper

References (21)

1. R. Amadio and S. Coupet-Grimal. Analysis of a guard condition in type theory (preliminary report). Technical Report TR 1997.245. Also appeared as RR-INRIA 3300, Université de Provence (L1M), 1997. Available at http://protis.univ-mrs.fr/~amadio.
2. H. Barendregt. The lambda calculus; its syntax and semantics. North-Holland, 1984.
3. Coq-project. The Coq proof assistant reference manual. Available at http://pauillac. inrta.fr/coq, 1996.
4. T. Coquand. Infinite objects in type theory. In Types for proofs and programs, Springer Lect. Notes in Comp. Sci. 806, 1993.
5. T. Coquand and G. Huet. A calculus of constructions. Information and Computation, 76:95-120, 1988.
6. S. Coupet-Grimal and L. Jakubiec. Coq and hardware verification: a case study. In Proc. TPHOL, Springer Lect. Notes in Comp. Sci. 1125, 1996.
7. H. Geuvers. Inductive and coinductive types with iteration and recursion. In Proc. of Workshop on types for proofs and programs, Nordstrom et al. (eds.), pages 193217, 1992. Available electronically.
8. E. Gimenez. Un calcul de constructions infinies et son application à la vérification de systèmes communicants. PhD thesis, ENS Lyon, 1996.
9. E. Gimenez. Personal communication. October 1997.
10. J.-Y. Girard, Y.Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
11. F. Leclerc and C. Paulin-Morhing. Programming with streams in Coq. A case study: the sieve of Eratosthenes. In Proc. TYPES, Springer Lect. Notes in Comp. Sci. 806, 1993.
12. R. Loader. Equational theories for inductive types. Annals of Pure and Applied Logic, 84:175-218, 1997.
13. G. Longo and E. Moggi. Constructive natural deduction and its modest interpretation. Mathematical Structures in Computer Science, 1:215-254, 1992.
14. N. Mendler. Recursive types and type constraints in second-order lambda calculus. In Proc. IEEE Logic in Comp. Sci., 1987.
15. M. Nesi. A formalization of the process algebra CCS in higher order logic. Technical Report 278, Computer Laboratory, University of Cambridge, December 1992.
16. L. Paulson. Mechanizing coinduction and corecursion in higher-order logic. J. of Logic and Computation, 7(2):175-204, 1997.
17. C. Rafialli. L’arithmétique fonctionnelle du second ordre avec point fixes. PhD thesis, Université Paris VII, 1994.
18. A. Salomaa. Two complete systems for the algebra of complete events. Journal of the ACM, 13-1, 1966.
19. D. Scott. Data types as lattices. SIAM J. of Computing, 5:522-587, 1976.
20. M. Tatsuta. Realizability interpretation of coinductive definitions and program synthesis with streams. Theoretical Computer Science, 122:119-136, 1994.
21. S. Thompson. Haskell. The craft of functional programming. Addison-Wesley, 1996.