Filters








14 Hits in 9.9 sec

Page 676 of Mathematical Reviews Vol. 30, Issue 4 [page]

1965 Mathematical Reviews  
J. 3590 A correspondence between atcot 60 and Church’s lambda-notation. II. Comm. ACM 8 (1965), 158-165.  ...  In this second part, the formal account of the translation of ALGOL 60 is given, as promised in Part I [same Comm. 8 (1965), 89-101; MR 30 #2710}.  ... 

References & bibliography [chapter]

1978 Lecture Notes in Computer Science  
"A Correspondance Between ALGOL 60 and Church's Lambda-Notation", (2 Parts) Comm. ACM, vol. 8, nos.2-3, pp.89-101 & 158-165, Feb.-March 1965.  ...  W.Henhapl & C.B.Jones: "A Formal Definition of ALGOL 60 as Described in the 1975 Modified Report", in: [Bj~rner 78a], pp.305-336, 1978.  ... 
doi:10.1007/3-540-08766-4_14 fatcat:axryqtlzh5bmpdm4ljtivsc4a4

Page 112 of IBM Systems Journal Vol. 10, Issue 2 [page]

IBM Systems Journal  
Landin, “Correspondence between ALGOL60 and Church’s Lambda-Notation, Part II,” Communications of the ACM 8, No. 3, 158-165 (1965). . C. C. Elgot and A.  ...  Landin, “Correspondence between ALGOL60 and Church’s Lambda-Notation, Part I,” Communications of the ACM 8, No. 2, 89-101 (1965). . P. J.  ... 

Échappements et continuations en semantique dénotationnelle [chapter]

P. Sallé
1980 Lecture Notes in Computer Science  
., A Correspondence Between ALGOL 60 and CHURCH'S Lambda Notations, ACM, Vol. 8, n ° 2 et 3, 1965, p. 8-101 et 158-165.  ...  SCOTT D., STRACHEY C., Towards a Mathematical Semantics for Computer Language, Proc. Symposium on Computer and Automata.  ... 
doi:10.1007/3-540-09981-6_21 fatcat:xiighx3icbahfiyk5tf3ub5obm

A Basis for a Mathematical Theory of Computation [chapter]

John McCarthy
1959 Studies in Logic and the Foundations of Mathematics  
A tenth section discussing the relations between mathematical logic and computation has bean added.  ...  This 1963 paper was included in Computer Programming and Formal Systems, edited by P. Braffort and D. Hirshberg and published by North-Holland.  ...  In order to use functionals it is convenient to have a notation for naming functions. We use Church's [1] lambda notation.  ... 
doi:10.1016/s0049-237x(09)70099-0 fatcat:5gbxralyjrghddtnatpnk2v3zq

A Basis for a Mathematical Theory of Computation) [chapter]

John McCarthy
1963 Studies in Logic and the Foundations of Mathematics  
In order to use functionals it is convenient to have a notation for naming functions. We use Church's [1] lambda notation.  ...  In our notation a conditional expression has the form (p 1 → e 1 , p 2 → e 2 , . . . , p n → e n ) which corresponds to the ALGOL 60 reference language (12) expression if p 1 then e 1 else if p 2 then  ... 
doi:10.1016/s0049-237x(08)72018-4 fatcat:tvkynsewjrghjhdrsmbphuswpq

Handling control

Dorai Sitaram
1993 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation - PLDI '93  
However, each language stops short of providing a full and complementary approach -control handling is provided only if the corresponding control operator is first-order.  ...  Non-local control transfer and exception handling have a long tradition in higher-order programming languages such as Common Lisp, Scheme and ML.  ...  I thank Matthias Felleisen and Bruce Duba for helpful discussions.  ... 
doi:10.1145/155090.155104 dblp:conf/pldi/Sitaram93 fatcat:6gidjxmakrhhdc3h5e7h6qxcve

The translation of programming languages through the use of a graph transformation language

Peter van den Bosch
1982 SIGPLAN notices  
In presenting this thesis in partial fulfilment of the requirements for an advanced degree at the University of British Columbia, I agree that the Library shall make it freely available for reference and  ...  Abstract It is shown that the automated translation of programming An evaluation of the completed research, and an assessment of its position within concurrent developments in the discipline of programming  ...  This notation will be extended, in the next section, to deal with graph patterns, by turning it into a kind of typed lambda notation, and thus answer the third of our questions about the syntactic transformation  ... 
doi:10.1145/947912.947920 fatcat:mp7yt3rb2vh33pvdpfvprechq4

Lambda calculus schemata

Michael J. Fischer
1972 SIGPLAN notices  
A lambda-calculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols.  ...  deletion strategy, modeled after the usual stack implementation of ALGOL 60, in which variable bindings are destroyed when control leaves the procedure (or block) in which they were created.  ...  We thank Carolyn Talcott for several helpful comments and for pointing out a serious error in an earlier draft, and we thank an anonymous referee for several helpful suggestions.  ... 
doi:10.1145/942578.807077 fatcat:avd3myyi6rdahm5xowg3pujoiq

Lambda-calculus schemata

Michael J. Fischer
1993 LISP and Symbolic Computation  
A lambda-calculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols.  ...  deletion strategy, modeled after the usual stack implementation of ALGOL 60, in which variable bindings are destroyed when control leaves the procedure (or block) in which they were created.  ...  We thank Carolyn Talcott for several helpful comments and for pointing out a serious error in an earlier draft, and we thank an anonymous referee for several helpful suggestions.  ... 
doi:10.1007/bf01019461 fatcat:z36lhsq5gjcqbplghyagyvrhzy

40 Years of Formal Methods [chapter]

Dines Bjørner, Klaus Havelund
2014 Lecture Notes in Computer Science  
informal and formal relations (|= 3 ) between domain descriptions and requirements prescriptions (D |= R), and domain descriptions & requirements prescriptions and software designs (D, S |= R).  ...  The techniques of a formal method help construct a specification, and/or analyse a specification, and/or transform (refine) one (or more) specification(s) into a program.  ...  Chris is a main co-developer of RAISE [52, 51] . From the early 1980s Chris has contributed to both the industrial and the academic progress of formal methods.  ... 
doi:10.1007/978-3-319-06410-9_4 fatcat:5hrbtlj2vzc4zidekw6hoo5g7q

On self-reproducing computer programs

D. Bilar, E. Filiol
2009 Journal in Computer Virology  
Lexicographic order of A * At this point, we want to introduce a broader Gödel numbering of A * . to this end, we will first explain what we mean by lexicographic order of A * . 5 For the Lambda notation  ...  Because of the close correspondence between the simula program π 4 and the pascal program π 6 , the programπ easily corresponds to the pascal program given in the proof of Proposition 5.1.  ...  The programπ begins with the input of the input variables of π and the processing of the whole instruction part  ... 
doi:10.1007/s11416-008-0115-z fatcat:feyoizzijvbcvllb4syq6wawhm

ActorScript(TM) extension of C sharp (TM), Java(TM), and Objective C(TM): iAdaptive(TM) concurrency for antiCloud(TM) privacy and security [article]

Carl Hewitt
2015 arXiv   pre-print
ActorScript(TM) is a general purpose programming language for implementing discretionary, adaptive concurrency that manages resources and demand.  ...  It is differentiated from previous languages by the following: - Universality *** Ability to specify what Actors can do *** Specify interface between hardware and software *** Everything in the language  ...  (Reprinted in Higher Order and Symbolic Computation. 1998) Peter Landin A correspondence between ALGOL 60 and Church's lambda notation CACM. August 1965.  ... 
arXiv:1008.2748v60 fatcat:nm6culxsqzey7mjgkjlrq5jpbu

A formalisation of design methods : a lambda-calculus approach to system design with an application to text editing [article]

LMG Loe Feijs, FEJ Frans Kruseman Aretz, JA Jan Bergstra
1990
In ASL [52] there is an explicit lambda notation for parameterisation, but the conneetion with the forma! implementation relation is not made.  ...  In remarks 3.4.9 (ii) and 3.4.14 (ii) an interesting difference between the top-down approach and the bottornup approach is revealed: the top down approach always yields a black-box correct design (even  ...  In init_display_handling we use the procedure cl from DISPLAY to clear the entire screen. upd(sscreen,ii,jj,blank); upd_j j (succ (j j)) ) *; j j -co ? ; upd_ii(succ(ii)) ) *; i i = l i ?  ... 
doi:10.6100/ir324749 fatcat:jgws4v7lz5bpdigaxkezwue2uy