메뉴 건너뛰기




Volumn 1214, Issue , 1997, Pages 309-320

A uniform syntactical method for proving coinduction principles in λ-calculi

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; SEMANTICS;

EID: 21744443930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030606     Document Type: Conference Paper
Times cited : (3)

References (12)
  • 1
    • 0000451579 scopus 로고
    • Full Abstraction in the Lazy Lambda Calculus
    • S. Abramsky, L. Ong, Full Abstraction in the Lazy Lambda Calculus, Information and Computation, 105(2):159-267, 1993.
    • (1993) Information and Computation , vol.105 , Issue.2 , pp. 159-267
    • Abramsky, S.1    Ong, L.2
  • 3
    • 0001293890 scopus 로고
    • Operational, denotational and logical Descriptions: A Case Study
    • L. Egidi, F. Honsell, S. Ronchi Della Rocca, Operational, denotational and logical Descriptions: a Case Study, Fundamenta Informaticae, 16(2):149-169, 1992.
    • (1992) Fundamenta Informaticae , vol.16 , Issue.2 , pp. 149-169
    • Egidi, L.1    Honsell, F.2    Ronchi Della Rocca, S.3
  • 4
    • 84947437004 scopus 로고
    • Final Semantics for untyped λ-calculus
    • M. Dezani et al., Edinburgh
    • F. Honsell, M. Lenisa, Final Semantics for untyped λ-calculus, M. Dezani et al. eds, TLCA'95 Springer LNCS, 902:249-265, Edinburgh, 1995.
    • (1995) TLCA'95 Springer LNCS , vol.902 , pp. 249-265
    • Honsell, F.1    Lenisa, M.2
  • 5
    • 0026902023 scopus 로고
    • Della Rocca, An approximation theorem for topological lambda models
    • F. Honsell, S. Ronchi Della Rocca, An approximation theorem for topological lambda models, J. of Computer and System Sciences, 45(1):49-75, 1992.
    • (1992) J. of Computer and System Sciences , vol.45 , Issue.1 , pp. 49-75
    • Honsell, F.1    Ronchi, S.2
  • 6
    • 0024897313 scopus 로고
    • Equality in Lazy Computation Systems, 4th LICS Conference Proceedings
    • D. Howe, Equality in Lazy Computation Systems, 4th LICS Conference Proceedings, IEEE Computer Society Press, 198-203, 1989.
    • (1989) IEEE Computer Society Press , pp. 198-203
    • Howe, D.1
  • 7
    • 0000627561 scopus 로고    scopus 로고
    • Proving Congruence of Bisimulation in Functional Programming Languages
    • D. Howe, Proving Congruence of Bisimulation in Functional Programming Languages, Information and Computation, 124(2):103-112, 1996.
    • (1996) Information and Computation , vol.124 , Issue.2 , pp. 103-112
    • Howe, D.1
  • 8
    • 84947908685 scopus 로고    scopus 로고
    • Final Semantics for a Higher Order Concurrent Language
    • H.Kirchner ed., Springer LNCS
    • M. Lenisa, Final Semantics for a Higher Order Concurrent Language, CAAP'96 Conference Proceedings, H.Kirchner ed., Springer LNCS, 1059:102-118, 1996.
    • (1996) CAAP'96 Conference Proceedings , vol.1059 , pp. 102-118
    • Lenisa, M.1
  • 11
    • 84957009038 scopus 로고    scopus 로고
    • An extensional partial combinatory algebra based on) λ-terms
    • Springer LNCS
    • P. Pérezé An extensional partial combinatory algebra based on) λ-terms, MFCS'91 Conference Proceedings, Springer LNCS, 520, 1996.
    • (1996) MFCS'91 Conference Proceedings , pp. 520
    • Pérezé, P.1
  • 12
    • 0002796916 scopus 로고    scopus 로고
    • Relational Properties of Domains
    • A.M. Pitts, Relational Properties of Domains, Inf. and Comp., 127:66-90, 1996.
    • (1996) Inf. and Comp , vol.127 , pp. 66-90
    • Pitts, A.M.1


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