메뉴 건너뛰기




Volumn 1998-June, Issue , 1998, Pages 300-308

Light affine logic

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EID: 76449092641     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705666     Document Type: Conference Paper
Times cited : (60)

References (10)
  • 4
    • 0010740750 scopus 로고
    • Proof nets: The parallel syntax for proof-Theory
    • Gi95, in Ursini and Agliano, editors, Marcel Dekker, New York
    • [Gi95] J.Y.Girard. Proof Nets: The parallel syntax for proof-Theory, in Ursini and Agliano, editors, Logic and Algebra, Marcel Dekker, New York, 1995.
    • (1995) Logic and Algebra
    • Girard, J.Y.1
  • 6
    • 0026851094 scopus 로고
    • Bounded Linear Logic: A modular approach to polynomial time computability
    • GSS92
    • [GSS92] J.Y.Girard, A. Scedrov, P.J.Scott. Bounded Linear Logic: A modular approach to polynomial time computability, Theoretical Computer Sci- ence, 97:1-66, 1992.
    • (1992) Theoretical Computer Science , vol.97 , pp. 1-66
    • Girard, J.Y.1    Scedrov, A.2    Scott, P.J.3
  • 8
    • 43949150474 scopus 로고
    • A foundational delineation of poly-Time
    • Le94
    • [Le94] D.Leivant. A foundational delineation of poly-Time, Information and Computation, 110:391- 420, 1994.
    • (1994) Information and Computation , vol.110 , pp. 391-420
    • Leivant, D.1
  • 9
    • 0000926057 scopus 로고
    • Lambda Calculus characterizations of poly-Time
    • LM93
    • [LM93] D.Leivant, J-Y.Marion. Lambda Calculus characterizations of poly-Time, Fundamenta In- formaticae, 19:167-184, 1993.
    • (1993) Fundamenta In- Formaticae , vol.19 , pp. 167-184
    • Leivant, D.1    Marion, J.-Y.2


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