Bird-Meertens Formalism - définition. Qu'est-ce que Bird-Meertens Formalism
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

Qu'est-ce (qui) est Bird-Meertens Formalism - définition

CALCULUS FOR DERIVING COMPUTER PROGRAMS FROM SPECIFICATIONS BY A PROCESS OF EQUATIONAL REASONING
Squiggol; Squigol; Bird-Meertens formalism; Bird-Merteens Formalism; Bird-Meertens Formalism; Bird–Meertens Formalism; Homomorphism lemma; List homomorphism lemma; Homomorphism Lemma
  • loc=Sect.5, p.124r}}
  • loc=Sect.2, p.123l}}
  • loc=Sect.7, Lem.1, p.125l}}
  • loc=Sect.2, p.123l}}
  • loc=Sect.5, p.124r}}
  • }

Bird-Meertens Formalism         
<theory, programming> (BMF) (Or "Squiggol") A calculus for derivation of functional programs from a specification. It consists of a set of higher-order functions that operate on lists including map, fold, scan, filter, inits, tails, cross product and function composition. ["A Calculus of Functions for Program Derivation", R.S. Bird, in Res Topics in Fnl Prog, D. Turner ed, A-W 1990]. ["The Squiggolist", ed Johan Jeuring, published irregularly by CWI Amsterdam]. (1995-05-01)
BirdMeertens formalism         
The BirdMeertens formalism (BMF) is a calculus for deriving programs from specifications (in a functional-programming setting) by a process of equational reasoning. It was devised by Richard Bird and Lambert Meertens as part of their work within IFIP Working Group 2.
Squiggol         

Wikipédia

Bird–Meertens formalism

The Bird–Meertens formalism (BMF) is a calculus for deriving programs from specifications (in a functional-programming setting) by a process of equational reasoning. It was devised by Richard Bird and Lambert Meertens as part of their work within IFIP Working Group 2.1.

It is sometimes referred to in publications as BMF, as a nod to Backus–Naur form. Facetiously it is also referred to as Squiggol, as a nod to ALGOL, which was also in the remit of WG 2.1, and because of the "squiggly" symbols it uses. A less-used variant name, but actually the first one suggested, is SQUIGOL.