3.3 KiB
zotero-key, zt-attachments, citekey
| zotero-key | zt-attachments | citekey | |
|---|---|---|---|
| XUWRH447g5383243 |
|
ProgrammingParadigms |
up:: zotero literature notes link:: Zotero attachment #pkm #zotero
[!cite] Programming Paradigms - Page Control flow in imperative programming is explicit: commands show how the computation takes place, step by step. Each step affects the global state of the computation.
[!note] Notes impératif :
- flot de contrôle explicite: explication pas-à-pas de ce qui doit être fait
- chaque pas affecte l'état global du calcul ^QVDN27WMaLQGLTH3Dg5383243
[!cite] Programming Paradigms - Page Structured programming is a kind of imperative programming where control flow is defined by nested loops, conditionals, and subroutines, rather than via gotos. Variables are generally local to blocks (have lexical scope).
[!note] Notes Programmation structurée:
- structures de contrôle plutôt que
goto- variables généralement locales à un block ^SW38ETVUaLQGLTH3Dg5383243
[!cite] Programming Paradigms - Page OOP is based on the sending of messages to objects. Objects respond to messages by performing operations, generally called methods. Messages can have arguments. A society of objects, each with their own local memory and own set of operations has a different feel than the monolithic processor and single shared memory feel of non object oriented languages.
[!note] Notes OOP : basé sur l'envoi de messages à des objets. ^KRIHCS5QaLQGLTH3Dg5383243
[!cite] Programming Paradigms - Page Control flow in declarative programming is implicit: the programmer states only what the result should look like, not how to obtain it.
[!note] Notes déclaratif : le flot de contrôle est implicite. on déclare ce que le résultat doit être plutôt que comment l'obtenir. ^3SBD24AEaLQGLTH3Dg5383243
[!cite] Programming Paradigms - Page In functional programming, control flow is expressed by combining function calls, rather than by assigning values to variables: ^8L7P34B2aLQGLTH3Dg5383243
[!cite] Programming Paradigms - Page Logic programming and constraint programming are two paradigms in which programs are built by setting up relations that specify facts and inference rules, and asking whether or not something is true (i.e. specifying a goal.) Unification and backtracking to find solutions (i.e.. satisfy goals) takes place automatically. ^JRBMX3NWaLQGLTH3Dg5383243