Implementing Coloured Petri Nets Using a Functional Programming Language

2004 ◽  
Vol 17 (3) ◽  
pp. 207-243 ◽  
Author(s):  
Lars Michael Kristensen ◽  
Søren Christensen
Keyword(s):  
Petri Nets ◽  
Programming Language ◽  
Functional Programming ◽  
Coloured Petri Nets ◽  
Functional Programming Language

The Alonzo functional programming language

1989 ◽  
Vol 24 (9) ◽  
pp. 152-157 ◽  
Author(s):  
J. D. Ramsdell
Keyword(s):  
Programming Language ◽  
Functional Programming ◽  
Functional Programming Language

Spreadsheet functional programming

2007 ◽  
Vol 17 (1) ◽  
pp. 131-143 ◽  
Author(s):  
DAVID WAKELING
Keyword(s):  
Programming Language ◽  
Functional Programming ◽  
Functional Programming Language

AbstractThe functional programming community has shown some interest in spreadsheets, but surprisingly no one seems to have considered making a standard spreadsheet, such as Excel, work with a standard functional programming language, such as Haskell. In this paper, we show one way that this can be done. Our hope is that by doing so, we might get spreadsheet programmers to give functional programming a try.

scholarly journals Heuristics Applied to Mutation Testing in an Impure Functional Programming Language

2019 ◽  
Vol 10 (6) ◽  
Author(s):  
Juan Guti´errez-C´ardenas ◽  
Hernan Quintana-Cruz ◽  
Diego Mego-Fernandez ◽  
Serguei Diaz-Baskakov
Keyword(s):  
Programming Language ◽  
Functional Programming ◽  
Mutation Testing ◽  
Functional Programming Language

Encapsulating non-determinacy in an abstract data type with determinate semantics

1991 ◽  
Vol 1 (1) ◽  
pp. 3-20 ◽  
Author(s):  
F. Warren Burton
Keyword(s):  
Parallel Algorithms ◽  
Programming Language ◽  
Functional Programming ◽  
Data Type ◽  
Parallel Program ◽  
Abstract Data Type ◽  
Functional Programming Language ◽  
Abstract Data

AbstractA parallel program may be indeterminate so that it can adapt its behavior to the number of processors available.Indeterminate programs are hard to write, understand, modify or verify. They are impossible to debug, since they may not behave the same from one run to the next.We propose a new construct, a polymorphic abstract data type called an improving value, with operations that have indeterminate behavior but simple determinate semantics. These operations allow the type of indeterminate behavior required by many parallel algorithms.We define improving values in the context of a functional programming language, but the technique can be used in procedural programs as well.

scholarly journals The ins and outs of Clean I/O

1995 ◽  
Vol 5 (1) ◽  
pp. 81-110 ◽  
Author(s):  
Peter Achten ◽  
Rinus Plasmeijer
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Functional Programming ◽  
Data Types ◽  
Spreadsheet Program ◽  
Functional Programming Languages ◽  
Hard Time ◽  
Functional Programming Language ◽  
Algebraic Data Types ◽  
High Level

AbstractFunctional programming languages have banned assignment because of its undesirable properties. The reward of this rigorous decision is that functional programming languages are side-effect free. There is another side to the coin: because assignment plays a crucial role in Input/Output (I/O), functional languages have a hard time dealing with I/O. Functional programming languages have therefore often been stigmatised as inferior to imperative programming languages because they cannot deal with I/O very well. In this paper, we show that I/O can be incorporated in a functional programming language without loss of any of the generally accepted advantages of functional programming languages. This discussion is supported by an extensive account of the I/O system offered by the lazy, purely functional programming language Clean. Two aspects that are paramount in its I/O system make the approach novel with respect to other approaches. These aspects are the technique of explicit multiple environment passing, and the Event I/O framework to program Graphical User I/O in a highly structured and high-level way. Clean file I/O is as powerful and flexible as it is in common imperative languages (one can read, write, and seek directly in a file). Clean Event I/O provides programmers with a high-level framework to specify complex Graphical User I/O. It has been used to write applications such as a window-based text editor, an object based drawing program, a relational database, and a spreadsheet program. These graphical interactive programs are completely machine independent, but still obey the look-and-feel of the concrete window environment being used. The specifications are completely functional and make extensive use of uniqueness typing, higher-order functions, and algebraic data types. Efficient implementations are present on the Macintosh, Sun (X Windows under Open Look) and PC (OS/2).

A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language

2011 ◽  
Vol 76 (2) ◽  
pp. 673-699 ◽  
Author(s):  
Michael Gabbay
Keyword(s):  
Logic Programming ◽  
Programming Language ◽  
Functional Programming ◽  
Order Logic ◽  
First Order Logic ◽  
Cut Elimination ◽  
Logic Programming Language ◽  
First Order ◽  
Functional Programming Language ◽  
Sequent System

AbstractWe build on an existing a term-sequent logic for the λ-calculus. We formulate a general sequent system that fully integrates αβη-reductions between untyped λ-terms into first order logic.We prove a cut-elimination result and then offer an application of cut-elimination by giving a notion of uniform proof for λ-terms. We suggest how this allows us to view the calculus of untyped αβ-reductions as a logic programming language (as well as a functional programming language, as it is traditionally seen).

Sign in / Sign up

Export Citation Format

Share Document