메뉴 건너뛰기




Volumn 19, Issue , 2004, Pages 139-148

A sequent calculus for nominal logic

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; INTEGER PROGRAMMING; LOGIC PROGRAMMING; NETWORK PROTOCOLS; SEMANTICS; THEOREM PROVING;

EID: 4544263413     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319608     Document Type: Conference Paper
Times cited : (34)

References (12)
  • 1
    • 35248827089 scopus 로고    scopus 로고
    • A spatial logic for concurrency (part II)
    • number 2421 in Lecture Notes in Computer Science
    • Luís Caires and Luca Cardelli. A spatial logic for concurrency (part II). In CONCUR'2002 Proceedings, number 2421 in Lecture Notes in Computer Science, 2002.
    • (2002) CONCUR'2002 Proceedings
    • Caires, L.1    Cardelli, L.2
  • 2
    • 84957830816 scopus 로고    scopus 로고
    • Alpha-Prolog, a logic programming language with names, binding, and alpha-equivalence
    • To appear
    • J. Cheney and C. Urban. Alpha-Prolog, a logic programming language with names, binding, and alpha-equivalence. In Proc. Int. Conf. on Logic Programming (ICLP 2004), 2004. To appear.
    • (2004) Proc. Int. Conf. on Logic Programming (ICLP 2004)
    • Cheney, J.1    Urban, C.2
  • 4
    • 23944501086 scopus 로고    scopus 로고
    • A new approach to abstract syntax with variable binding
    • M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2001.
    • (2001) Formal Aspects of Computing , vol.13 , pp. 341-363
    • Gabbay, M.J.1    Pitts, A.M.2
  • 9
    • 0042969226 scopus 로고    scopus 로고
    • A proof theory for generic judgments: An extended abstract
    • IEEE, June
    • Dale Miller and Alwen Tiu. A proof theory for generic judgments: An extended abstract. In Proceedings of LICS 2003, pages 118-127. IEEE, June 2003.
    • (2003) Proceedings of LICS 2003 , pp. 118-127
    • Miller, D.1    Tiu, A.2
  • 10
    • 0142089908 scopus 로고    scopus 로고
    • Nominal logic, a first order theory of names and binding
    • A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 186:165-193, 2003.
    • (2003) Information and Computation , vol.186 , pp. 165-193
    • Pitts, A.M.1


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