Filters








217 Hits in 6.9 sec

Page 4891 of Mathematical Reviews Vol. , Issue 80M [page]

1980 Mathematical Reviews  
Langmaack, Hans; Lippe, Wolfram; Wagner, Franz 80m:68045 The formal termination problem for programs with finite ALGOL 68-modes. Inform. Process. Lett. 9 (1979), no. 3, 155-159.  ...  -241; MR 50 #3636] that the macro prop- erty is decidable for programs with finite modes in the sense of ALGOL 68.  ... 

Page 4218 of Mathematical Reviews Vol. , Issue 99f [page]

1999 Mathematical Reviews  
The generative capacity is studied for the case of systems with regular components, when deriving in the synchronized, unsynchronized or terminal mode.  ...  game semantics for IDEALIZED ALGOL with active expressions.  ... 

An implementation of affix grammars [chapter]

Hans Meijer
1980 Lecture Notes in Computer Science  
In the text we assume some familiarity with (context-free) grammars and the languages Algol 60 and Algol 68.  ...  (defining affixes finite, finite domains for only-applied affix variables, no circular affix definitions, etc.), the analogue being a compiler which also accepts non-terminating programs.  ...  This is probably the hardest problem in the project. What is the complexity of the generated transducers/ compilers? Are they correct?  ... 
doi:10.1007/3-540-10250-7_27 fatcat:i5ipu3yejjapljeyrnz5kitmie

Grammars with structured vocabulary: A model for the algol-68 definition

John L. Baker
1972 Information and Control  
Although the requirement that the terminal vocabulary elements be composed only of protovariables is in exact agreement with the ALGOL-68 definition, the requirement that the terminal vocabulary be finite  ...  The names of ALGOL-68 modes (corresponding to ALGOL-60 types), for example, are formed in this way, and the set from which these names are chosen includes procedure-integral (mode corresponding to an integer  ...  In formal terms, the portion of the construction just described requires the If we assume, as before, that each line of (15) is followed by "nl", call the resulting string X, and denote by Y the string  ... 
doi:10.1016/s0019-9958(72)90217-3 fatcat:e5vepyb3hzcbbcpbjuuwe3go2a

Page 328 of Mathematical Reviews Vol. , Issue 82a [page]

1982 Mathematical Reviews  
Although the decidability of left Szilard equivalence remains open, we reduce this problem to the equivalence problem for a special class of s-grammar forms.” 82a:68 148 Nelson, Evelyn Categorical and  ...  82:68 142 Istrail, Sorin 82a:68 142 A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs.  ... 

Semantics for lisp without reference to an interpreter [chapter]

W. M. Lippe, F. Simon
1980 Lecture Notes in Computer Science  
In [Si, Si/Tr, Si I] it has been shown that LISP is essentially an ALGOL-like programming language.  ...  In this paper we are going to define an ALGOL-like syntax and semantics for LISP that reflect the important features of LISP, whereas some of the "exotic" ones are dropped.  ...  In LISP/N completely specified modes, finite or infinite, are defined by mode equations put in front of the program, but they are so simple that we don't run into problems as in ALGOL 68.  ... 
doi:10.1007/3-540-09981-6_17 fatcat:b5bxbwfetfhkdc6ahouucieuc4

Page 4813 of Mathematical Reviews Vol. , Issue 86j [page]

1986 Mathematical Reviews  
The present paper extends these results to a language which covers almost the complete range of ALGOL 68 programs with finite modethe only exception being procedure/function vari- ables.  ...  For the case of PASCAL programs (with mode depth < 2) and a restricted subset of programs with arbitrary finite mode depth, relative completeness results were obtained independently by E.-R.  ... 

Abstracts of Current Computer Literature

1969 IEEE transactions on computers  
in Multiprocessors 6704 Applicability of a Concept Learning Program to a Geometry Analogy Task 6713 Formal Deductive Problem-Solving Program 6714 Heuristic Program for Solving Algebraic Problems 6716  ...  The generated ALGOL program uses a straightforward and efficient algorithm for choosing the apprcpriate decision rule.  ... 
doi:10.1109/t-c.1969.222696 fatcat:yhhpsujxdraaflgkml3euqfkxa

Fifty years of Hoare's logic

Krzysztof R. Apt, Ernst-Rüdiger Olderog
2019 Formal Aspects of Computing  
Acknowledgements We would like to thank all three reviewers for exceptionally detailed and helpful referee reports that led us to improve and expand the presentation.  ...  Procedures of an arbitrary finite mode depth, corresponding to arbitrary higher types, as in Algol 68 [vWMP + 75] , or even with self-application, i.e., with procedure calls of the form call p(. . . ,  ...  As a first step, Langmaack proved in [Lan82] that for all Algol-like programs in L 4 the divergence problem is decidable for finite interpretations.  ... 
doi:10.1007/s00165-019-00501-3 fatcat:vzxfucuz45fozhicmxzkxdpdjm

Reviews and Descriptions of Tables and Books

1971 Mathematics of Computation  
It contains the usual material on errors, finite differences, interpolation, numerical differentiation and quadratures, a very short review of numerical integration of ordinary differential equations,  ...  This is probably one of the few books on the subject originally written in the Portuguese language and in that sense has special interest. The printing and general presentation are good.  ...  Minority Report, ALGOL Bulletin 31, p. 7) that ALGOL 68 is not sufficiently advanced to facilitate the reliable creation of today's more sophisticated programs.  ... 
doi:10.1090/s0025-5718-71-99722-5 fatcat:uw63lcfayjfdtn733loyvm3mcy

Abstracts of Current Computer Literature

1968 IEEE transactions on computers  
., vol. 68, p. 97(A), February 10, 1968. PB 176 767 CFSTI $3.00. 5735 EULER: A Generalization of ALGOL, and Its Formal Definition, N. Wirth and H. Weber (Stanford U.); Rept.  ...  The specific problem with which this paper deals is that of using the computer to answer English questions. Implementation of Syntax Analysis Using ALGOL-see 5737.  ... 
doi:10.1109/tc.1968.227432 fatcat:yjxmdy2fz5f6ph7qef6m72b6mq

On the basis for ELF

T. E. Cheatham, A. Fischer, P. Jorrand
1968 Proceedings of the December 9-11, 1968, fall joint computer conference, part II on - AFIPS '68 (Fall, part II)  
types and operations (or, if ALGOL-68 is familar to you, similar to ALGOL-68).  ...  That is, it is not enough to have a language facility which is formally sufficient to allow the user to solve his problem; indeed, most available programming languages are, to within certain size limitations  ... 
doi:10.1145/1476706.1476710 dblp:conf/afips/CheathamFJ68 fatcat:5l7uswsl2zaulith4icobwvhxy

Abstracts of Current Computer Literature

1970 IEEE transactions on computers  
systems, especially with respect to the organization of paging schemes. 7849 The Use of ALGOL 68 for Trees, H.  ...  These notes discuss the use of a binary tree programmed in ALGOL 68 and of a tree-structured reference system to the local definitions of ALGOL 68 syntactic elements.  ... 
doi:10.1109/t-c.1970.223037 fatcat:to2dda73zzh2jlyq3um6rpr3pe

Fifty years of Hoare's Logic [article]

Krzysztof R. Apt, Ernst-Ruediger Olderog
2019 arXiv   pre-print
Acknowledgements We would like to thank all three reviewers for exceptionally detailed and helpful referee reports that led us to improve and expand the presentation.  ...  Procedures of an arbitrary finite mode depth, corresponding to arbitrary higher types, as in Algol 68 [vWMP + 75], or even with self-application, i.e., with procedure calls of the form call p(. . . , p  ...  As a first step, Langmaack proved in [Lan82] that for all Algol-like programs in L 4 the divergence problem is decidable for finite interpretations.  ... 
arXiv:1904.03917v2 fatcat:kfpjuntx35g4vhnkvsnetmkdnm

On the formalization of programming languages: Early history and main approaches [chapter]

Peter Lucas
1978 Lecture Notes in Computer Science  
of those languages for which the systems were built.  ...  Artificial Intelligence has experimented for some time with languages that can be used to talk about objects other than numbers etc.; we should probably look a lot more fre-  ...  with the signification of signs in all modes of sig- nifying; definition of ALGOL 60 [Backus 59].  ... 
doi:10.1007/3-540-08766-4_8 fatcat:mx676jusxzewpo4ayj55rppi74
« Previous Showing results 1 — 15 out of 217 results