Revised report on the algorithmic language ALGOL 60

  title={Revised report on the algorithmic language ALGOL 60},
  author={John Warner Backus and Friedrich L. Bauer and Julien Green and C. Katz and John McCarthy and Peter Naur and Alan J. Perlis and Heinz Rutishauser and Klaus Samelson and Bernard Vauquois and Joseph Henry Wegstein and Adriaan van Wijngaarden and Michael Woodger},
  journal={Comput. J.},
@article{m:lisp, author = {McCarthy, J.}, title = {Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I}, journal = {Communications of the ACM}, volume = {3}, number = {4}, pages = {184-195}, year = 1960 } Summary: McCarthy introduces LISP. LISP deviates from other contemporary languages such as ALGOL as its design revolves around the idea that partial recursive functions of symbolic expressions can be an effective programming language. Mc-Carthy gives meaning to… 
Grammar-based genetic programming
The thesis demonstrates that neither GE nor LOGENPRO provide a substantial advantage over CFG-GP in any of the experiments, and analyses the differences between the effects of operators used in CFg-GP and GE.
Controlled Natural Language
  • Lnai Founding
  • Computer Science
    Lecture Notes in Computer Science
  • 2010
A methodology for representation of ontologies in a strictly typed language with dependent types is developed and an experiment where SUMO was translated to GF (Grammatical Framework), a type-theoretical grammar formalism mainly used for natural language applications.
Definition von Datentypen durch Grammatiken in Datenbanken
Data Warehousing, OLAP und Data Mining gewinnen als Basistechnologien zur Versorgung betrieblicher Entscheidungsträger durch eine stärkere Ausrichtung der Informationsverarbeitung auf
An ALGOL-based associative language
A high level programming language for large, complex associative structures has been designed and implemented using a hash-coding technique and the discussion includes a comparison with other work and examples of applications.
Some techniques for algorithm optimization with application to matrix arithmetic expressions
This thesis contributes to the production of optimum algorithms in two ways: a technique was developed for producing new algorithms equivalent to old algorithms, and a technique is described which reduces the effort required by certain exhaustive searches over 'well- structured' search spaces.
The Main Features of CPL
The paper provides an informal account of CPL, a new programming language currently being implemented for the Titan at Cambridge and the Atlas at London University. CPL is based on, and contains the
Nonlinear Control Structure Design using Grammatical Evolution and Lyapunov Equation based Optimization
The results show that the proposed approach is capable of outperforming state of the art methods by providing stronger stability guarantees and/or better closed loop performance while making less restrictive assumptions.
Lecture Notes in Software Engineering Budapest, 11-22 October 2010
“standard” domain description and requirements prescription examples using the RAISE [112] Specification Language, RSL are presented using examples of transportation networks and other examples.
Discovering New Rule Induction Algorithms with Grammar-based Genetic Programming
  • G. Pappa, A. Freitas
  • Computer Science
    Soft Computing for Knowledge Discovery and Data Mining
  • 2008
This work proposes the use of a grammar-based genetic programming (GGP) algorithm to automatically discover new sequential covering algorithms, and the automatically-discovered rule induction algorithms are compared with four well-known human-designedrule induction algorithms.
Logics in Artificial Intelligence
  • José Leite
  • Computer Science
    Lecture Notes in Computer Science
  • 2004
This talk will illustrate the “engineering of logics” with the example of so-called Description Logics and their application for conceptual modeling of databases and as ontology languages for the semantic web.