FPk

This page is about FPk, an implementation of FP, an untyped, functional programming language.

Introduction

FP is a beautiful, untyped, first-order purely functional language defined by John Backus in his Turing Award lecture _Can Programming Be Liberated from the von Neumann Style?_. The language requires programming at the "function level" and is point-free. FPk is an FP interpreter written in O'Caml.

News

• 2005-10-05–uploaded 0.52, which allows one to load definitions from a file (see the tutorial)

Download

FP is open-source; you can download either binaries or O'Caml source:

• Interesting Documents
  • _Can Programming Be Liberated from the von Neumann Style?_ (J.Backus)(pdf)
  • FPk Tutorial (pdf)
• FPk Interpreter
  • source (version 0.52)
  • native-compiled Mac OS X/PPC
  • native-compiled GNU Linux/PPC
  • native-compiled GNU Linux/x86
  • native-compiled Win32/x86

Screenshot

FPk in action demonstrating factorial, flattening lists, maximum of a list, list concatenation, and sequence generation

More Information

For more information, you're very much encouraged to read the Backus paper and the tutorial! If you still have any questions, you can mail me at the address provided in the tutorial pdf. Feedback is also very welcome about any bugs, etc. that you've encountered.