To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Lustre (programming language)

From Wikipedia, the free encyclopedia

Lustre is a formally defined, declarative, and synchronous dataflow programming language for programming reactive systems. It began as a research project in the early 1980s. A formal presentation of the language can be found in the 1991 Proceedings of the IEEE.[1] In 1993 it progressed to practical, industrial use in a commercial product as the core language of the industrial environment SCADE, developed by Esterel Technologies. It is now used for critical control software in aircraft,[2] helicopters, and nuclear power plants.

YouTube Encyclopedic

  • 1/3
    Views:
    603
    3 729
    541
  • Lustre Performance Analysis with SystemTap
  • Introduction to Lustre from Whamcloud's Andreas Dilger
  • Tensor Flow for HPC?

Transcription

Structure of Lustre programs

A Lustre program is a series of node definitions, written as:

node foo(a : bool) returns (b : bool);
let
  b = not a;
tel

Where foo is the name of the node, a is the name of the single input of this node and b is the name of the single output. In this example the node foo returns the negation of its input a, which is the expected result.

Inner variables

Additional internal variables can be declared as follows:

node Nand(X,Y: bool) returns (Z: bool);
  var U: bool;
let
  U = X and Y;
  Z = not U;
tel

Note: The equations order doesn't matter, the order of lines U = X and Y; and Z = not U; doesn't change the result.

Special operators

pre p Returns the previous value of p
p -> q Set p as the initial value of the expression q

Examples

Edge detection

node Edge (X : bool) returns (E : bool);
let
  E = false -> X and not pre X;
tel

See also

References

  1. ^ [1] N. Halbwachs et al. The Synchronous Data Flow Programming Language LUSTRE. In Proc. IEEE 1991 Vol. 79, No. 9. Accessed 17 March 2014.
  2. ^ "SCADE Success Stories". Retrieved 8 June 2013.

External links

This page was last edited on 4 April 2024, at 17:18
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.