Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory (2003)
Cached
Download Links
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [www.dcs.edinburgh.ac.uk]
- [www.kurims.kyoto-u.ac.jp]
- DBLP
Other Repositories/Bibliography
by
Alex Simpson
| Venue: | In Proc. 17th IEEE Symposium on Logic in Computer Science |
| Citations: | 8 - 2 self |
Document Versions
| Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory –Alex Simpson — 2003 — In Proc. 17th IEEE Symposium on Logic in Computer Science |
| Computational adequacy for recursive types in models of intuitionistic set theory –Alex Simpson — 2002 — In Proc. 17th Symposium on Logic in Comp. Sci |
| Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory –Alex Simpson — 2002 — In Proc. 17th IEEE Symposium on Logic in Computer Science |
| Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory –Alex Simpson — 2002 — In Proc. 17th IEEE Symposium on Logic in Computer Science |
| Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory –Alex Simpson — 2002 — In Proc. 17th IEEE Symposium on Logic in Computer Science |
