SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Electronic Notes in Theoretical Computer Science

Volumn 1, Issue C, 1995, Pages 232-252

Bisimilarity as a Theory of Functional Programming

(1) Gordon, Andrew D a

a UNIVERSITY OF CAMBRIDGE (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; PROBLEM SOLVING; SEMANTICS; SET THEORY;

BISIMULATIONS; FUNCTIONAL PROGRAMMING; LABELLED TRANSITIONS; MORRIS-STYLE CONTEXTUAL EQUIVALENCE;

MATHEMATICAL PROGRAMMING;

EID: 19044401072 PISSN: 15710661 EISSN: None Source Type: Journal
DOI: 10.1016/S1571-0661(04)80013-6 Document Type: Article

Times cited : (55)

References (31)

1
- 84916483405
- Samson Abramsky. The lazy lambda calculus. In Turner [29], pages 65–116.

2
- 77956968984
- An introduction to inductive definitions
- J. Barwise, North-Holland
- (1977) Handbook of Mathematical Logic , pp. 739-782
- Aczel¹

3
- 84916495476
- Karen L. Bernstein and Eugene W. Stark. Operational semantics of a focusing debugger. In Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers B.V., 1995.

4
- 84916464527
- Bard Bloom. Can LCF be topped? Flat lattice models of typed lambda calculus. In Proceedings of the 3rd IEEE Symposium on Logic in Computer Science, pages 282–295. IEEE Computer Society Press, 1988.

5
- 84916511625
- Thierry Coquand. Infinite objects in type theory. In Types of Proofs and Programs, pages 62–78, volume 806 of Lecture Notes in Computer Science. Springer-Verlag, 1993.

6
- 84916511340
- Roy L. Crole and Andrew D. Gordon. A sound metalogical semantics for input/output effects. In Computer Science Logic'94, Kazimierz, Poland, September 1994, volume 933 of Lecture Notes in Computer Science. Springer-Verlag, June 1995.

7
- 0004232136
- Cambridge University Press
- (1990) Introduction to Lattices and Order
- Davey¹ Priestley²

8
- 0002193891
- Control operators, the SECD-machine, and the λ-calculus
- North-Holland
- (1986) Formal Description of Programming Concepts III , pp. 193-217
- Felleisen¹ Friedman²

9
- 4544293396
- Cambridge University Press
- (1994) Functional Programming and Input/Output
- Andrew Gordon¹

10
- 0004114762
- MIT Press, Cambridge, Mass
- (1992) Semantics of Programming Languages: Structures and Techniques
- Carl Gunter¹

11
- 84916475829
- Douglas J. Howe. Equality in lazy computation systems. In Proceedings of the 4th IEEE Symposium on Logic in Computer Science, pages 198–203, 1989.

12
- 84916465149
- Douglas J. Howe. Proving congruence of bisimulation in functional programming languages. Preprint, 1994.

13
- 84916524057
- I. A. Mason, S. F. Smith, and C. L. Talcott. From operational semantics to domain theory. Submitted for publication, 1994.

14
- 84916511103
- Thomas F. Melham. A package for inductive relation definitions in HOL. In Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications, Davis, California, pages 350–357. IEEE Computer Society Press, 1991.

15
- 0001862336
- Fully abstract models of typed lambda-calculi
- (1977) Theoretical Computer Science , vol.4 , pp. 1-23
- Milner¹

16
- 0003954103
- Prentice-Hall International
- (1989) Communication and Concurrency
- Milner¹

17
- 84916509657
- James H. Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, MIT, December 1968.

18
- 84916484206
- C.-H. Luke Ong. Correspondence between operational and denotational semantics: The full abstraction problem for PCF. Submitted to Handbook of Logic in Computer Science Volume 3, OUP 1994, January 1994.

19
- 84916502132
- David Park. Concurrency and automata on infinite sequences. In Peter Deussen, editor, Theoretical Computer Science: 5th GI-Conference, Karlsruhe, volume 104 of Lecture Notes in Computer Science, pages 167–183. Springer-Verlag, March 1981.

20
- 84916507367
- Lawrence C. Paulson. Co-induction and co-recursion in higher-order logic. Technical Report 304, University of Cambridge Computer Laboratory, 1993.

21
- 84976855404
- FLIC–a functional language intermediate code
- (1988) ACM SIGPLAN Notices , vol.23 , Issue.8 , pp. 30-48
- Simon Peyton¹

22
- 84916463800
- Andrew Pitts and Ian Stark. On the observable properties of higher order functions that dynamically create local names (preliminary report). In SIPL'93:ACM SIGPLAN Workshop on State in Programming Languages, pages 31–45, June 1993.

23
- 0028380721
- A co-induction principle for recursively defined domains
- (1994) Theoretical Computer Science , vol.124 , pp. 195-219
- Andrew Pitts¹

24
- 0000230630
- LCF considered as a programming language
- (1977) Theoretical Computer Science , vol.5 , pp. 223-255
- Gordon Plotkin¹

25
- 84971179364
- Fully abstract translations between functional languages
- (1993) Mathematical Structures in Computer Science , vol.3 , pp. 387-415
- Jon Riecke¹

26
- 84916494852
- Eike Ritter and Andrew M. Pitts. A fully abstract translation between a λ-calculus with reference types and Standard ML. In Proceedings TLCA '95, Edinburgh, 1995.

27
- 0003066059
- Operational theories of improvement in functional languages (extended abstract)
- Springer-Verlag
- (1992) Functional Programming, Glasgow 1991, Workshops in Computing , pp. 298-311
- Sands¹

28
- 84916479296
- Davide Sangiorgi. On the bisimulation proof method. Technical Report ECS–LFCS–94–299, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, August 1994.

29
- 0347165439
- Addison-Wesley
- (1990) Research Topics in Functional Programming
- Turner¹

30
- 84971896354
- Comprehending monads
- (1992) Mathematical Structures in Computer Science , vol.2 , pp. 461-493
- Wadler¹

31
- 0004273499
- MIT Press, Cambridge, Mass
- (1993) The Formal Semantics of Programming Languages
- Winskel¹

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