Journal of Functional Programming
- Journal of Functional Programming
Infobox Magazine
title = Journal of Functional Programming
editor = Paul Hudak, Xavier Leroy
frequency = Bimonthly
circulation =
category = Scientific journal
company = Cambridge University Press
firstdate = 1991
country = United Kingdom
language = English
website = [http://journals.cambridge.org/jid_JFP]
issn = 0956-7968
The "Journal of Functional Programming" is the only journal devoted solely to the design, implementation, and application of functional programming languages, spanning the range from mathematical theory to industrial practice. Topics covered include functional languages and extensions, implementation techniques, reasoning and proof, program transformation and synthesis, type systems, type theory, language-based security, memory management, parallelism and applications. The journal is of interest to computer scientists, software engineers, programming language researchers and mathematicians interested in the logical foundations of programming.
Missing Content
The Journal's copyright holder currently only makes volumes 7 and later available online [http://journals.cambridge.org/action/displayJournal?jid=JFP] . Volumes 1-6 (1996 and prior) are currently not available in electronic format. No plan for availability has been announced.
ISSN information
* (print version of journal)
* (electronic version of journal)
External links
* [http://journals.cambridge.org/jid_JFP Cambridge Journals Online — Journal home page]
* [http://www.informatik.uni-trier.de/~ley/db/journals/jfp/ Journal of Functional Programming] from DBLP
Wikimedia Foundation.
2010.
Look at other dictionaries:
Journal of Functional Programming — (JFP) est une revue scientifique spécialisée dans le domaine de la programmation fonctionnelle. Liens externes Site de la revue Portail de la presse écrite … Wikipédia en Français
Functional programming — In computer science, functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids state and mutable data. It emphasizes the application of functions, in contrast with the… … Wikipedia
Programming language theory — (commonly known as PLT) is a branch of computer science that deals with the design, implementation, analysis, characterization, and classification of programming languages and programming language features. It is a multi disciplinary field, both… … Wikipedia
Total functional programming — (also known as strong functional programming [This term is due to: Citation|last1=Turner|first1=D.A.|author link=David Turner (computer scientist)|contribution=Elementary Strong Functional Programming|title=First International Symposium on… … Wikipedia
Journal of Systems and Software — Infobox Magazine title = Journal of Systems and Software editor = D. N. Card frequency = Monthly circulation = category = Software systems company = Elsevier firstdate = 1979 country = The Netherlands language = English website =… … Wikipedia
Racket (programming language) — Racket Paradigm(s) Multi paradigm: Functional, Procedural, Modular, Object oriented, Reflective, Meta Appeared in 1994 Developer … Wikipedia
Functional decomposition — refers broadly to the process of resolving a functional relationship into its constituent parts in such a way that the original function can be reconstructed (i.e., recomposed) from those parts by function composition. In general, this process of … Wikipedia
Epigram (programming language) — Epigram is the name of a functional programming language with dependent types and of the IDE usually packaged with it. Epigram s type system is strong enough to express program specifications. The goal is to support a smooth transition from… … Wikipedia
Computer programming — Programming redirects here. For other uses, see Programming (disambiguation). Software development process Activities and steps … Wikipedia
Programming language for Computable Functions — The Programming language for Computable Functions, or PCF, is a typed functional language introduced by Gordon Plotkin in 1977. It is based on the Logic of Computable Functions (LCF) by Dana Scott. It can be considered as a simplified version of… … Wikipedia
