Filters








121 Hits in 3.1 sec

The Essence of Reynolds

Stephen Brookes, Peter W. O'Hearn, Uday Reddy
2014 Formal Aspects of Computing  
In this paper we pay tribute to the man, his ideas, and his influence.  ...  I-XII, 1-500 • From Algol to polymorphic linear lambda-calculus. J. ACM 47(1): 167-223, 2000.  ...  employing polymorphic linear lambda calculus).  ... 
doi:10.1007/s00165-014-0295-x fatcat:cf3w7y647ratnebxbisrrw6oee

The essence of Reynolds

Stephen Brookes, Peter W. O'Hearn, Uday Reddy
2014 Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '14  
In this paper we pay tribute to the man, his ideas, and his influence.  ...  I-XII, 1-500 • From Algol to polymorphic linear lambda-calculus. J. ACM 47(1): 167-223, 2000.  ...  employing polymorphic linear lambda calculus).  ... 
doi:10.1145/2535838.2537851 dblp:conf/popl/BrookesOR14 fatcat:gf5zdcx4j5dyhebxwbgwpvhere

Page 2552 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
linear lambda calculus.  ...  To formalize ALGOL’s notion of ‘orthogonality’, we define an extended /-calculus that models ALGOL.  ... 

Page 509 of Mathematical Reviews Vol. , Issue 2002A [page]

2002 Mathematical Reviews  
; Pittsburgh, PA From Algol to polymorphic linear lambda-calculus.  ...  We explore this connection by translating two variations on Algol 60 into a purely functional language with polymorphic linear types.  ... 

Page 1568 of Mathematical Reviews Vol. , Issue 80D [page]

1980 Mathematical Reviews  
‘Z’ is a statically-oriented language, based on ideas borrowed from vari- ous sources, including set theory, abstract data types, relational data bases, LISP, APL, and ALGOL-like syntax; it aims to pro  ...  The authors propose such a type-checking system where programming constructs are first translated into the lambda-calculus and where the resulting expression is typed.  ... 

The essence of ML

J. C. Mitchell, R. Harper
1988 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88  
To copy otherwise, or to republish, requires a fee and/or specfic permission.  ...  Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the  ...  Thanks also to Andrzej Tarlecki for comments on an earlier draft.  ... 
doi:10.1145/73560.73563 dblp:conf/popl/MitchellH88 fatcat:gt75bavmljgpbh75e4hs3knadm

The transformation calculus [chapter]

Jacques Garrigue
1995 Lecture Notes in Computer Science  
This calculus remains very close to lambda-calculus, and keeps most of its properties.  ...  The lambda-calculus, by its ability to express any computable function, is theoretically able to represent any algorithm.  ...  This subject starts with Landin's encoding of Algol 60 into the lambda calculus [Lan65] .  ... 
doi:10.1007/3-540-60692-0_46 fatcat:j4ztlaffbngrhodhzmf3wof6w4

Page 472 of Mathematical Reviews Vol. , Issue 98A [page]

1998 Mathematical Reviews  
Amadio, Lone Leth and Bent Thomsen, From a concurrent 4-calculus to the z-calculus (106-115); Valentin Antimirov [V. M.  ...  Henzinger, The theory of hybrid automata (278- 292); Bernard Willems and Pierre Wolper, Partial-order methods for model checking: from linear time to branching time (294-303); Girish Bhat and Rance Cleaveland  ... 

Delta functions: An introduction to generalised functions

1999 Computers and Mathematics with Applications  
Polymorphism. 18. Module specification. 19. Algol-like languages. Appendix. Mathematical background. Bibliography. Index. Functions: An Introduction to Generalised Functions. By R. F. Hoskins.  ...  The lambda calculus. 11. An eager functional language. 12. Continuations in a functional language. 13. Iswim-like languages. 14. A normal-order language. 15. The simple type system.16.  ... 
doi:10.1016/s0898-1221(99)91229-4 fatcat:jp5zn5et5fcopmbkexefi2v3v4

Theories of programming languages

1999 Computers and Mathematics with Applications  
Polymorphism. 18. Module specification. 19. Algol-like languages. Appendix. Mathematical background. Bibliography. Index. Functions: An Introduction to Generalised Functions. By R. F. Hoskins.  ...  The lambda calculus. 11. An eager functional language. 12. Continuations in a functional language. 13. Iswim-like languages. 14. A normal-order language. 15. The simple type system.16.  ... 
doi:10.1016/s0898-1221(99)91227-0 fatcat:yb4dfwf5nzhxfgthp2k7jggtju

Access database design and programming, second edition

1999 Computers and Mathematics with Applications  
Polymorphism. 18. Module specification. 19. Algol-like languages. Appendix. Mathematical background. Bibliography. Index. Functions: An Introduction to Generalised Functions. By R. F. Hoskins.  ...  The lambda calculus. 11. An eager functional language. 12. Continuations in a functional language. 13. Iswim-like languages. 14. A normal-order language. 15. The simple type system.16.  ... 
doi:10.1016/s0898-1221(99)91225-7 fatcat:4zmvcd6czndddibjnzxpdouvje

Computational partial differential equations: Numerical methods and diffpack programming

1999 Computers and Mathematics with Applications  
Polymorphism. 18. Module specification. 19. Algol-like languages. Appendix. Mathematical background. Bibliography. Index. Functions: An Introduction to Generalised Functions. By R. F. Hoskins.  ...  The lambda calculus. 11. An eager functional language. 12. Continuations in a functional language. 13. Iswim-like languages. 14. A normal-order language. 15. The simple type system.16.  ... 
doi:10.1016/s0898-1221(99)91231-2 fatcat:omqhcuyy7zbzjfmgrixhvmrhdy

Objects and Classes in Algol-Like Languages

Uday S. Reddy
2002 Information and Computation  
The "types" like exp[δ] and comm are called "phrase types" to distinguish them from data types.  ...  Except for cls θ types, the remaining type structure is that of simply typed lambda calculus with record types and subtyping. See, for instance, Mitchell [34, Ch. 10] for details.  ...  In a sense, IA + is to Idealized Algol what SOL is to polymorphic lambda calculus.  ... 
doi:10.1006/inco.2001.2927 fatcat:ppotyqt5d5b7ppi76wmdxljpji

A reformulation-linearization technique for solving discrete and continuous nonconvex problems

1999 Computers and Mathematics with Applications  
Polymorphism. 18. Module specification. 19. Algol-like languages. Appendix. Mathematical background. Bibliography. Index. Functions: An Introduction to Generalised Functions. By R. F. Hoskins.  ...  The lambda calculus. 11. An eager functional language. 12. Continuations in a functional language. 13. Iswim-like languages. 14. A normal-order language. 15. The simple type system.16.  ... 
doi:10.1016/s0898-1221(99)91233-6 fatcat:bhpalcikgnen7prybzf2rtu3uu

Deadline scheduling for real-time systems: EDF and related algorithms

1999 Computers and Mathematics with Applications  
Polymorphism. 18. Module specification. 19. Algol-like languages. Appendix. Mathematical background. Bibliography. Index. Functions: An Introduction to Generalised Functions. By R. F. Hoskins.  ...  The lambda calculus. 11. An eager functional language. 12. Continuations in a functional language. 13. Iswim-like languages. 14. A normal-order language. 15. The simple type system.16.  ... 
doi:10.1016/s0898-1221(99)91235-x fatcat:ar3s3xhd6zhrrdnph5hu45cptm
« Previous Showing results 1 — 15 out of 121 results