MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Fix-Point Equations for Well-Founded Recursion in Type Theory." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

ATOM

Fix-point Equations for Well-Founded Recursion in Type Theory
by Antonia Balaa, Yves Bertot — 2000 — Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science
…Fix-point Equations for Well-Founded Recursion in Type Theory Antonia Balaa and Yves Bertot INRIA…
Cited by 12 (3 self) – Add To MetaCart

A More General Type Theoretic Interpretation Of Constructive Set Theory
by Peter Aczel, Nicola Gambino, Abstracts Aarne Ranta, Marcin Benke, Antonia Balaa, Yves Bertot (inria Sophia-antipolis — 2000
… for Well-Founded Recursion in Type Theory Sunday 10 December, 17:3018:00 Inductive type theories, as used…
Add To MetaCart

Showing 1 through 2.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB