Dependent intersection: A new way of defining records in type theory

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 86-95

  Kopylov, Alexei ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; NUMBER THEORY; SET THEORY; COMPUTER SCIENCE; FORMAL LANGUAGES; FORMAL LOGIC; MATHEMATICAL PROGRAMMING;

DEPENDENT FUNCTIONS;

COMPUTER PROGRAMMING;

DEPENDENT FUNCTIONS; MATHEMATICAL CONCEPTS; PRIMITIVE TYPES; PROGRAM VERIFICATION; RESEARCH INITIATIVES; STANDARD TYPE; TYPE SYSTEMS; TYPE THEORY;

EID: 0041967501     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. nd IEEE Symposium on Logic in Computer Science, pages 215-224. IEEE Computer Society Press, June 1987.
2. Stuart F. Allen. A Non-Type-Theoretic Semantics for Type-Theoretic Language. PhD thesis, Cornell University, 1987.
3. Lennart Augustsson. Cayenne - a language with dependent types. In International Conference on Functional Programming, pages 239-250, 1998.
4. Gustavo Betarte and Alvaro Tasistro. Extension of Martin-Löfs type theory with record types and subtyping. In Giovanni Sambin and Jan M. Smith, editors, Twenty-Five Years of Constructive Type Theory, volume 36 of Oxford Logic Guides, pages 21-39, Oxford, 1998. Clarendon Press.
5. Robert L. Constable. Types in logic, mathematics and programming. In Sam Buss, editor, Handbook of Proof Theory, chapter 10. Elsevier Science, 1997.
6. Robert L. Constable et al. Implementing Mathematics with the NuPRL Development System. Prentice-Hall, 1986.
7. Robert L. Constable and Jason Hickey. NuPRL's class theory and its applications. In Friedrich L. Bauer and Ralf Steinbrueggen, editors, Foundations of Secure Computation, NATO ASI Series, Series F: Computer & System Sciences, pages 91-116. IOS Press, 2000.
8. Mario Coppo and Mariangiola Dezani-Ciancaglini, An extension of the basic functionality theory for the λ-calculus. Notre-Dame Journal of Formal Logic, 21(4):685-693, October 1980.
9. Judicaël Courant. An applicative module calculus. In TAPSOFT, Lectures Notes in Computer Science, pages 622-636, Lille, France, April 1997. Springer-Verlag.
10. Robert Harper and Mark Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Conference record of POPL '94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 123-137, Portland, OR, January 1994.
11. Jason J. Hickey. Formal objects in type theory using very dependent types. In Foundations of Object Oriented Languages 3, 1996. Available electronically through the FOOL 3 home page.
12. Jason J. Hickey. The MetaPRL Logical Programming Environment. PhD thesis, Cornell University, Ithaca, NY, January 2001.
13. Jason J. Hickey, Aleksey Nogin, Alexei Kopylov, et al. MetaPRL home page, http://metaprl.org/.
14. th Annual Conference of the EACSL, volume 2142 of Lecture Notes in Computer Science, pages 570-584. Springer-Verlag, 2001.
15. Xavier Leroy. Manifest types, modules, and separate compilation. In Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 109-122. ACM Press, 1994.
16. Per Martin-Löf. Intuitionistic Type Theory, Studies in Proof Theory, Lecture Notes. Bibliopolis, Napoli, 1984.
17. th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2002), volume 2410 of Lecture Notes in Computer Science, pages 263-280. Springer-Verlag, 2002.
18. Benjamin C. Pierce. Programming with intersection types, union types, and polymorphism. Technical Report CMU-CS-91-106, Carnegie Mellon University, February 1991.
19. th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science, pages 461-478. Springer-Verlag, 2000.
20. Garrel Pottinger. A type assignment for the strongly normalizable λ-terms. In Jonathan P. Seldin and J. Roger Hindley, editors, To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, pages 561-577. Academic Press, London, 1980.
21. John C. Reynolds. Design of the programming language forsythe. Technical Report CMU-CS-96-146, Carnegie Mellon University, June 1996.