SCOPUS 정보 검색 플랫폼

Theoretical Computer Science

Volumn 103, Issue 2, 1992, Pages 235-271

The revised report on the syntactic theories of sequential control and state

(2) Felleisen, Matthias a Hieb, Robert b

a RICE UNIVERSITY (United States)

b INDIANA UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - THEOREM PROVING; COMPUTER METATHEORY - EQUIVALENCE CLASSES; COMPUTER METATHEORY - PROGRAMMING THEORY; COMPUTER PROGRAMMING LANGUAGES - MATHEMATICAL MODELS; SWITCHING THEORY - STATE ASSIGNMENT;

CHURCH ROSSER THEOREMS; EQUATIONAL REASONING; IMPERATIVE PROGRAMMING; LAMBDA CALCULUS; STANDARDIZATION THEOREMS; SYNTACTIC THEORIES OF CONTROL AND STATE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0026913084 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(92)90014-7 Document Type: Article

Times cited : (325)

References (25)

1
- 0025212954
- Explicit substitution
- Revised Edition, ACM, New York
- (1990) Proc. 17th ACM Symposium on Principles of Programming Languages , pp. 31-46
- Abadi¹ Cardelli² Curien³ Lévy⁴

2
- 0003214304
- The Lambda Calculus: Its Syntax and Semantics
- North-Holland, Amsterdam
- (1984) Studies in Logic and the Foundations of Mathematics , vol.103
- Barendregt¹

3
- 0003692125
- Princeton University Press, Princeton, NJ
- (1956) Introduction to Mathematical Logic
- Church¹

4
- 0020890501
- Making variables abstract: an equational theory for Russell
- ACM, New York
- (1983) Proc. 10th ACM Symp. Principles of Programming Languages , pp. 59-72
- Demers¹ Donahue²

5
- 0003882245
- The calculi of lambda-υ-CS-conversion: a syntactic theory of control and state in imperative higher-order programming languages
- Indiana University
- (1987) Ph.D. Dissertation
- Felleisen¹

6
- 84991473765
- The theory and practice of first-class prompts
- ACM, New York
- (1988) Proc. 15th ACM Symp. Principles of Programming Languages , pp. 180-190
- Felleisen¹

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

8
- 0024916815
- A syntactic theory of sequential state
- (1989) Theoret. Comput. Sci. , vol.69 , pp. 243-287
- Felleisen¹ Friedman²

9
- 85034810254
- A syntactic theory of sequential state
- preliminary version, ACM, New York
- (1987) Proc. 14th ACM Symp. Principles of Programming Languages , pp. 314-325
- Felleisen¹ Friedman²

10
- 0023602624
- A syntactic theory of sequential control
- (1987) Theoret. Comput. Sci. , vol.52 , pp. 205-237
- Felleisen¹ Friedman² Kohlbecker³ Duba⁴

11
- 0022955294
- A syntactic theory of sequential control
- Computer Soc. Press, Cambridge, MA, preliminary version
- (1986) Proc. Symp. Logic in Computer Science , pp. 131-141
- Felleisen¹ Friedman² Kohlbecker³ Duba⁴

12
- 0025211131
- A formulae-as-types notion of control
- ACM, New York
- (1990) Proc. 17th ACM Symp. Principles of Programming Languages , pp. 47-58
- Griffin¹

13
- 84943347452
- The next 700 programming languages
- (1966) Communications of the ACM , vol.9 , Issue.3 , pp. 157-166
- Landin¹

14
- 0001097061
- The mechanical evaluation of expressions
- (1964) The Computer Journal , vol.6 , Issue.4 , pp. 308-320
- Landin¹

15
- 0022995130
- Equivalences of first-order Lisp programs
- (1986) Proc. Symp. Logic in Computer Science , pp. 105-117
- Mason¹

16
- 85029872176
- Programming, transforming, and proving with function abstractions and memories
- Springer, Berlin, Lecture Notes in Computer Science
- (1989) Proc. Internat. Conf. Automata, Languages and Programming , vol.372 , pp. 574-588
- Mason¹ Talcott²

17
- 0024926911
- A sound and complete axiomatization of operational equivalence between programs with memory
- Computer Soc. Press, Pacific Grove, CA
- (1989) Proc. Symp. Logic in Computer Science , pp. 284-293
- Mason¹ Talcott²

18
- 0003444157
- MIT Press, Cambridge, MA
- (1990) The Definition of Standard ML
- Milner¹ Tofte² Harper³

19
- 0024927385
- Computational lambda-calculus and monads
- Computer Soc. Press, Pacific Grove, CA
- (1989) Proc. Symp. Logic in Computer Science , pp. 14-23
- Moggi¹

20
- 18944377121
- Call-by-name, call-by-value, and the λ-calculus
- (1975) Theoret. Comput. Sci. , vol.1 , pp. 125-159
- Plotkin¹

21
- 84909891396
- 3 report on the algorithmic language Scheme
- (1986) ACM SIGPLAN Notices , vol.21 , Issue.12 , pp. 37-79
- Rees¹ Clinger²

22
- 0004274872
- Digital Press, Belford, MA
- (1984) Common Lisp—The Language
- Steele¹

23
- 0011610776
- Scheme: An interpreter for extended lambda calculus, Memo
- MIT AI Lab
- (1975) Memo 349
- Sussman¹ Steele²

24
- 2342614638
- Rum: An intensional theory with function and control abstractions
- Springer, Berlin, Lecture Notes in Computer Science
- (1988) Proc. 1987 Workshop on Found. of Logic and Functional Programming , vol.306 , pp. 3-45
- Talcott¹

25
- 0039492080
- The essence of rum—A theory of the intensional and extensional aspects of lisp-type computation
- Stanford University
- (1985) Ph.D. Dissertation
- Talcott¹

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