메뉴 건너뛰기




Volumn 1290, Issue , 1997, Pages 197-209

A deciding algorithm for linear isomorphism of types with complexity O(nlog2(n))

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS);

EID: 0013403205     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0026989     Document Type: Conference Paper
Times cited : (9)

References (8)
  • 4
    • 33750697159 scopus 로고
    • Provable isomorphism of types
    • Ecole Normale Superieure, Paris
    • K. Bruce, R. Di Cosmo and G. Longo. Provable isomorphism of types. Preprint LIENS-90-14, Ecole Normale Superieure, Paris (1990).
    • (1990) Preprint LIENS-90-14
    • Bruce, K.1    Di Cosmo, R.2    Longo, G.3
  • 5
    • 0002393824 scopus 로고
    • Closed categories and Proof Theory
    • G.E. Mints. Closed categories and Proof Theory. J.Soviet Math., 15 (1981), 45-62.
    • (1981) J.Soviet Math , vol.15 , pp. 45-62
    • Mints, G.E.1
  • 6
    • 85034950980 scopus 로고
    • Linear logic and lazy computation
    • Lecture Notes in Comp.Sci. 250
    • G.-Y. Girard, Y. Lafont. Linear logic and lazy computation. In: Proc.TAPSOFT 87 (Pisa), v.2, p.52-66, Lecture Notes in Comp.Sci. 250 (1987).
    • (1987) Proc.Tapsoft 87 (Pisa) , vol.2 , pp. 52-66
    • Girard, G.-Y.1    Lafont, Y.2
  • 7
    • 78449232292 scopus 로고
    • A complete axiom system for isomorphism of types in closed categories
    • S.V. Soloviev. A complete axiom system for isomorphism of types in closed categories. - Lecture Notes in Artificial Intelligence, 698 (1993), 380-392.
    • (1993) Lecture Notes in Artificial Intelligence , vol.698 , pp. 380-392
    • Soloviev, S.V.1


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