메뉴 건너뛰기




Volumn 3091, Issue , 2004, Pages 24-39

A type-based termination criterion for dependently-typed higher-order rewrite systems

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

EID: 35048812954     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25979-4_2     Document Type: Article
Times cited : (38)

References (26)
  • 1
    • 21144433501 scopus 로고    scopus 로고
    • Termination and productivity checking with continuous types
    • A. Abel. Termination and productivity checking with continuous types. In Proc. of TLCA'03, LNCS 2701.
    • Proc. of TLCA'03, LNCS , vol.2701
    • Abel, A.1
  • 2
    • 33645482880 scopus 로고    scopus 로고
    • Termination checking with types
    • Ludwig Maximilians Universität, München, Germany
    • A. Abel. Termination checking with types. Technical Report 0201, Ludwig Maximilians Universität, München, Germany, 2002.
    • (2002) Technical Report 0201
    • Abel, A.1
  • 4
    • 0001439401 scopus 로고
    • Lambda calculi with types
    • S. Abramski, D. Gabbay, and T. Maibaum, editors, Oxford University Press
    • H. Barendregt. Lambda calculi with types. In S. Abramski, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.
    • (1992) Handbook of Logic in Computer Science , vol.2
    • Barendregt, H.1
  • 6
    • 35248869192 scopus 로고    scopus 로고
    • Inductive types in the Calculus of Algebraic Constructions
    • LNCS
    • F. Blanqui. Inductive types in the Calculus of Algebraic Constructions. In Proc. of TLCA'03, LNCS 2701.
    • Proc. of TLCA'03 , vol.2701
    • Blanqui, F.1
  • 7
    • 33750692203 scopus 로고    scopus 로고
    • Rewriting modulo in Deduction modulo
    • LNCS
    • F. Blanqui. Rewriting modulo in Deduction modulo. In Proc. of RTA'03, LNCS 2706.
    • Proc. of RTA'03 , vol.2706
    • Blanqui, F.1
  • 8
    • 84941179813 scopus 로고
    • Termination and confluence of higher-order rewrite systems
    • F. Blanqui. Termination and confluence of higher-order rewrite systems. In Proc. of RTA'00, LNCS 1833.
    • (1833) Proc. of RTA'00, LNCS
    • Blanqui, F.1
  • 9
    • 84944130043 scopus 로고    scopus 로고
    • A type-based termination criterion for dependently-typed higher-order rewrite systems
    • F. Blanqui. A type-based termination criterion for dependently-typed higher-order rewrite systems. Draft. 38 pages. http://www.loria.fr/~blanqui/.
    • Draft , pp. 38
    • Blanqui, F.1
  • 13
    • 0023965424 scopus 로고
    • The Calculus of Constructions
    • T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2-3):95-120, 1988.
    • (1988) Information and Computation , vol.76 , Issue.2-3 , pp. 95-120
    • Coquand, T.1    Huet, G.2
  • 17
    • 0031212315 scopus 로고    scopus 로고
    • Termination of nested and mutually recursive algorithms
    • J. Giesl. Termination of nested and mutually recursive algorithms. Journal of Automated Reasoning, 19(1):1-29, 1997.
    • (1997) Journal of Automated Reasoning , vol.19 , Issue.1 , pp. 1-29
    • Giesl, J.1
  • 19
    • 0033574362 scopus 로고    scopus 로고
    • Parametricity and variants of Girard's J operator
    • R. Harper and J. Mitchell. Parametricity and variants of Girard's J operator. Information Processing Letters, 70:1-5, 1999.
    • (1999) Information Processing Letters , vol.70 , pp. 1-5
    • Harper, R.1    Mitchell, J.2
  • 20
    • 0001820666 scopus 로고    scopus 로고
    • Proving the correctness of reactive systems using sized types
    • J. Hughes, L. Pareto, and A. Sabry. Proving the correctness of reactive systems using sized types. In Proc. of POPL'96.
    • Proc. of POPL'96.
    • Hughes, J.1    Pareto, L.2    Sabry, A.3
  • 24
    • 0004278720 scopus 로고    scopus 로고
    • PhD thesis, Katholiecke Universiteit Nijmegen, The Netherlands
    • M. Stefanova. Properties of Typing Systems. PhD thesis, Katholiecke Universiteit Nijmegen, The Netherlands, 1998.
    • (1998) Properties of Typing Systems
    • Stefanova, M.1
  • 25
    • 0037350925 scopus 로고    scopus 로고
    • Termination of rewriting in the Calculus of Constructions
    • D. Walukiewicz-Chrza̧szcz. Termination of rewriting in the Calculus of Constructions. Journal of Functional Programming, 13(2):339-414, 2003.
    • (2003) Journal of Functional Programming , vol.13 , Issue.2 , pp. 339-414
    • Walukiewicz-Chrza̧szcz, D.1
  • 26
    • 0036521845 scopus 로고    scopus 로고
    • Dependent types for program termination verification
    • H. Xi. Dependent types for program termination verification. Journal of Higher-Order and Symbolic Computation, 15(1):91-131, 2002.
    • (2002) Journal of Higher-Order and Symbolic Computation , vol.15 , Issue.1 , pp. 91-131
    • Xi, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.