Polarized subtyping for sized types

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

Volumn 3967 LNCS, Issue , 2006, Pages 381-392

  Abel, Andreas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DIFFERENTIATION (CALCULUS); MATHEMATICAL MODELS; NUMERICAL ANALYSIS; THEOREM PROVING;

BOUNDED QUANTIFICATION; NORMALIZATION THEOREM; SUBTYPING CALCULUS;

COMPUTATION THEORY;

EID: 33745883277     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11753728_39     Document Type: Conference Paper

References (26)

1. A. Abel, Weak normalization for the simply-typed lambda-calculus in Twelf. In logical Frameworks and Metalanguages (LFM 04). IJCAR, Cork, Ireland, 2004.
2. A. Abel and R. Matthes. Fixed points of type constructors and primitive recursion. In Computer Science Logic, CSL'04, vol. 3210 of LNCS, pp. 190-204. Springer, 2004.
3. A. Abel, R. Matches, and T. Uustalu. Iteration schemes for higher-order and nested datatypes. Theoretical Computer Science, 333(1-2):3-66, 2005.
4. R. Adams. A Modular Hierarchy of Logical Frameworks. Ph.D. thesis, University of Manchester, 2005.
5. T. Altenkirch and B. Reus, Monadic presentations of lambda terms using generalized inductive types. In J. Flum and M. Rodríguez-Artalejo, eds., Computer Science Logic, CSL '99, Madrid, Spain, September, 1999, vol. 1683 of LNCS, pp. 453-468. Springer, 1999.
6. G. Barthe, M. J. Frade, E. Giménez, L. Pinto, and T. Uustalu. Type-based termination of recursive definitions, Mathematical Structures in Computer Science, 14(1):1-45, 2004.
7. R. S. Bird and R. Paterson. De Bruijn notation as a nested datatype. J. of Funct. Program., 9(1):77-91, 1999.
8. A. Compagnoni and H. Goguen. Anti-symmetry of higher-order subtyping and equality by subtyping. Submitted, 2005.
9. A. B. Compagnoni and H. Goguen. Anti-symmetry of higher-order subtyping. In J. Flum and M. Rodríguez-Artalejo, eds., Computer Science Logic, CSL '99, Madrid, Spain, September, 1999, vol. 1683 of LNCS, pp. 420-438. Springer, 1999.
10. A. B. Compagnoni and H. Goguen. Typed operational semantics for higher-order subtyping. Inf. Comput., 184(2):242-297, 2003.
11. T. Coquand, An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, eds., Logical Frameworks, pp. 255-279. Cambridge University Press, 1991.
12. D. Duggan and A. Compagnoni. Subtyping for object type constructors, 1998. Presented at FOOL 6.
13. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types, vol. 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
14. H. Goguen. Typed operational semantics. In M. Deziani-Ciancaglini and G. D. Plotkin, eds., Typed Lambda Calculi and Applications (TLCA 1995), vol. 902 of LNCS, pp. 186-200. Springer, 1995.
15. H. Goguen. Soundness of the logical framework for its typed operational semantics. In J.-Y. Girard, ed., Typed Lambda Calculi and Applications, TLCA 1999, vol. 1581 of LNCS. Springer, L'Aquila, Italy, 1999.
16. H. Goguen. Justifying algorithms for βη conversion. In V. Sassone, ed., Foundations of Software Science and Computational Structures, FOSSACS 2005, Edinburgh, UK, April 2005, vol. 3441 of LNCS, pp. 410-424. Springer, 2005.
17. R. Harper and F. Pfenning. On equivalence and canonical forms in the LF type theory. ACM Transactions on Computational Logic, 6(1):61-101, 2005.
18. R. Hinze. Generalizing generalized tries. J. of Funct. Program., 10(4):327-351, 2000.
19. J. Hughes, L. Pareto, and A. Sabry. Proving the correctness of reactive systems using sized types. In Symposium on Principles of Programming Languages, pp. 410-423. 1996.
20. F. Joachimski and R. Matthes. Short proofs of normalization. Archive of Mathematical Logic, 42(1):59-87, 2003.
21. N. P. Mendler. Recursive types and type constraints in second-order lambda calculus. In Logic in Computer Science (LICS'87), Ithaca, N.Y., pp. 30-36. IEEE Computer Society Press, 1987.
22. C. Okasaki. From Fast Exponentiation to Square Matrices: An Adventure in Types. In International Conference on Functional Programming, pp. 28-35. 1999.
23. B. C. Pierce. Types and Programming Languages. MIT Press, 2002.
24. B. C. Pierce and M. Steffen. Higher order subtyping. Theor. Comput. Sci., 176(1,2):235-282, 1997.
25. M. Steffen. Polarized Higher-Order Subtyping. Ph.D. thesis, Technische Fakultät, Universität Erlangen, 1998.
26. K. Watkins, I. Cervesato, F. Pfenning, and D. Walker. A concurrent logical framework I: Judgements and properties. Tech. rep., School of Computer Science, Carnegie Mellon University, Pittsburgh, 2003.