메뉴 건너뛰기




Volumn 266, Issue 1-2, 2001, Pages 1-57

Primitive recursion for higher-order abstract syntax

Author keywords

Higher order abstract syntax; Modal logic; Primitive recursion; Typed lambda calculus

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA STRUCTURES; LOGIC PROGRAMMING; RECURSIVE FUNCTIONS;

EID: 0035817921     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00418-7     Document Type: Article
Times cited : (55)

References (22)
  • 7
    • 0003731872 scopus 로고    scopus 로고
    • Tech. Report CMU-CS-96-172, Carnegie Mellon University, September
    • (1996)
  • 9
    • 60949254017 scopus 로고
    • On an extension of finitary mathematics which has not yet been used
    • S. Feferman, et al.,(Eds.), Oxford University Press, Oxford
    • (1990) Kurt Gödel, Collected Works , vol.2 , pp. 271-280
    • Gödel, K.1
  • 20
    • 84947743461 scopus 로고
    • Inductive definitions in the system Coq: Rules and properties
    • M. Bezem, J.F. Groote (Eds.), Proc. Internat. Conf. on Typed Lambda Calculi and Applications, Utrecht, The Netherlands, Springer, Berlin, March
    • (1993) Lecture Notes in Computer Science , vol.664 , pp. 328-345
    • Paulin-Mohring, C.1
  • 21
    • 0002474842 scopus 로고
    • Logic programming in the LF logical framework
    • G. Huet, G. Plotkin (Eds.), Cambridge University Press, Cambridge
    • (1991) Logical Frameworks , pp. 149-181
    • Pfenning, F.1


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