Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Higher-Order and Symbolic Computation - incl. option to publish open access (Editorial Board)

Higher-Order and Symbolic Computation

Higher-Order and Symbolic Computation

Editors-in-Chief: O. Danvy; C.L. Talcott

ISSN: 1388-3690 (print version)
ISSN: 1573-0557 (electronic version)

Journal no. 10990


Olivier Danvy
University of Aarhus, Denmark

Carolyn L. Talcott
SRI International, Menlo Park, CA, USA

Associate Editors:

Anindya Banerjee
IMDEA Software, Madrid, Spain

David Basin
ETH Zentrum, Zurich, Switzerland

R. Kent Dybvig
Indiana University, Bloomington, USA

Andrzej Filinski
University of Copenhagen, Denmark

Philippe de Groote
LORIA & INRIA-Lorraine, Nancy, France

Robert Harper
Carnegie Mellon University, PA, USA

Patricia Johann
Rutgers University, Camden, NJ, USA

Andy King
University of Kent, UK

Julia L. Lawall
University of Copenhagen, Denmark

Ian Mason
Loyalty Ventures, Inc., CA, USA

Oege de Moor
Oxford University, UK

Julian Padget
University of Bath, UK

Paola Quaglia
Università di Trento, Italy

Peter Thiemann
Universität Freiburg, Germany

Advisory Board:

Samson Abramsky, University of Oxford Computing Laboratory, UK; Jérôme Chailloux, GENSET, France; Patrick Cousot, Ecole Normale Supérieure, France; Radhia Cousot, Ecole Polytechnique, France; Pierre-Louis Curien, CNRS and Université Denis Diderot (Paris VII), France; Peter Dybjer, Chalmers University of Technology, Sweden; Daniel P. Friedman, Indiana University, USA; Yoshihiko Futamura, Waseda University, Japan; Kokichi Futatsugi, Japan Advanced Institute of Science and Technology, Japan; Richard P. Gabriel, IBM Research, USA; Nevin Heintze, Agere Systems, USA; Carl Hewitt, MIT Artificial Intelligence Laboratory, USA; Paul Hudak, Yale University, USA; Masayuki Ida, Aoyama Gakuin University, Japan; Tetsuo Ida, University of Tsukuba, Japan; Takayasu Ito, Tohoku University, Sendai, Japan; Neil Jones, University of Copenhagen, DenmarkKenneth Kahn, Animated Programs, USA; Robert R. Kessler, University of Utah, USADavid B. MacQueen, University of Chicago, USA; Harry Mairson, Brandeis University, USA; John McCarthy, Stanford University, USA; F. Lockwood Morris, Syracuse University, USAPeter D. Mosses, Swansea University, UK; Mogens Nielsen, University of Aarhus, Denmark; Atsushi Ohori, Japan Advanced Institute of Science and Technology, Japan; Jean-François Perrot, Université Pierre et Marie Curie (Paris VI), France; Andrew M. Pitts, University of Cambridge, UK; Gordon Plotkin, University of Edinburgh, UK; John C. Reynolds, Carnegie Mellon University, USA; Jon G. Riecke, Aleri Inc., USA; David A. Schmidt, Kansas State University, USA; Helmut Schwichtenberg, Ludwig-Maximilians-Universität München, Germany; Guy L. Steele Jr., Sun Microsystems Labs., USA; David S. Touretzky, Carnegie Mellon University, USA; Chris Wadsworth, independent consultant, UK; Mitchell Wand, Northeastern University, USA; Daniel Weise, Independent consultant, USA; Jon L White, CommerceOne, Inc., USA; Glynn Winskel, University of Cambridge, UK

Read this Journal on Springerlink

For authors and editors

  • Aims and Scope

    Aims and Scope


    Higher-Order and Symbolic Computation is an international journal that presents a broad-spectrum forum for results and ideas concerning programming with higher-order and symbolic facilities: first-class functions and continuations, effects and higher-order types, objects, actors, and programs as data. Papers ranging from theory and design to practice and experience and especially about theory used in practice are welcomed, as well as occasional expository papers. The aim is to promote the exchange of ideas and synergy amongst researchers with a wide range of interests and expertise.

    Key subject areas and topics covered in the journal include:

    Functional programming with effects;
    Object-oriented programming;
    Parallel, concurrent, distributed, and mobile symbolic and functional computation;
    Programming concepts and abstractions - data abstraction, lazy evaluation, infinite data objects, self reference, reflection, continuations, components, generic functions, inheritance, encapsulation, protection, persistence, meta-objects, communication protocols, etc.;
    Programming language theory - semantics, specifying and reasoning about programs, programming logics, types and type inference;
    Semantics based program manipulation - compilation, analysis, partial evaluation, instrumentation, and other program transformations;
    Implementations and techniques - specialized architectures, compiler design, combinatory models, garbage collection, storage management, and performance analysis;
    Programming environments and tools - knowledge-based programming tools, artificial intelligence tools, monitoring, and debugging tools;
    Applications and experience with symbolic computing in the context of real time programming, window systems, user interfaces, operating systems, object-oriented programming, and parallel/distributed computing.

  • Open Choice - Your Way to Open Access
  • Instructions for Authors

    Instructions for Authors


  • Author Academy: Training for Authors
  • English Language Editing

    English Language Editing


  • Copyright Information

    Copyright Information


    Copyright Information

    For Authors

    Submission of a manuscript implies: that the work described has not been published before (except in form of an abstract or as part of a published lecture, review or thesis); that it is not under consideration for publication elsewhere; that its publication has been approved by all co-authors, if any, as well as – tacitly or explicitly – by the responsible authorities at the institution where the work was carried out.

    Author warrants (i) that he/she is the sole owner or has been authorized by any additional copyright owner to assign the right, (ii) that the article does not infringe any third party rights and no license from or payments to a third party is required to publish the article and (iii) that the article has not been previously published or licensed. The author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. Transfer of copyright to Springer (respective to owner if other than Springer) becomes effective if and when a Copyright Transfer Statement is signed or transferred electronically by the corresponding author. After submission of the Copyright Transfer Statement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted by Springer.

    The copyright to this article, including any graphic elements therein (e.g. illustrations, charts, moving images), is assigned for good and valuable consideration to Springer effective if and when the article is accepted for publication and to the extent assignable if assignability is restricted for by applicable law or regulations (e.g. for U.S. government or crown employees).

    The copyright assignment includes without limitation the exclusive, assignable and sublicensable right, unlimited in time and territory, to reproduce, publish, distribute, transmit, make available and store the article, including abstracts thereof, in all forms of media of expression now known or developed in the future, including pre- and reprints, translations, photographic reproductions and microform. Springer may use the article in whole or in part in electronic form, such as use in databases or data networks for display, print or download to stationary or portable devices. This includes interactive and multimedia use and the right to alter the article to the extent necessary for such use.

    Authors may self-archive the Author's accepted manuscript of their articles on their own websites. Authors may also deposit this version of the article in any repository, provided it is only made publicly available 12 months after official publication or later. He/she may not use the publisher's version (the final article), which is posted on SpringerLink and other Springer websites, for the purpose of self-archiving or deposit. Furthermore, the Author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: "The final publication is available at link.springer.com".

    Prior versions of the article published on non-commercial pre-print servers like arXiv.org can remain on these servers and/or can be updated with Author's accepted version. The final published version (in pdf or html/xml format) cannot be used for this purpose. Acknowledgement needs to be given to the final publication and a link must be inserted to the published article on Springer's website, accompanied by the text "The final publication is available at link.springer.com". Author retains the right to use his/her article for his/her further scientific career by including the final published journal article in other publications such as dissertations and postdoctoral qualifications provided acknowledgement is given to the original source of publication.

    Author is requested to use the appropriate DOI for the article. Articles disseminated via link.springer.com are indexed, abstracted and referenced by many abstracting and information services, bibliographic networks, subscription agencies, library networks, and consortia.

    For Readers

    While the advice and information in this journal is believed to be true and accurate at the date of its publication, neither the authors, the editors, nor the publisher can accept any legal responsibility for any errors or omissions that may have been made. The publisher makes no warranty, express or implied, with respect to the material contained herein.

    All articles published in this journal are protected by copyright, which covers the exclusive rights to reproduce and distribute the article (e.g., as offprints), as well as all translation rights. No material published in this journal may be reproduced photographically or stored on microfilm, in electronic data bases, video disks, etc., without first obtaining written permission from the publisher (respective the copyright owner if other than Springer). The use of general descriptive names, trade names, trademarks, etc., in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.

    Springer has partnered with Copyright Clearance Center's RightsLink service to offer a variety of options for reusing Springer content. For permission to reuse our content please locate the material that you wish to use on link.springer.com or on springerimages.com and click on the permissions link or go to copyright.com, then enter the title of the publication that you wish to use. For assistance in placing a permission request, Copyright Clearance Center can be connected directly via phone: +1-855-239-3415, fax: +1-978-646-8600, or e-mail: info@copyright.com.

    © Springer Science+Business Media New York

Alerts for this journal


Get the table of contents of every new issue published in Higher-Order and Symbolic Computation.