oskar
831 lines
57 KiB
BibTeX
831 lines
57 KiB
BibTeX
@book{abelsonStructureInterpretationComputer1996,
|
||
title = {Structure and {{Interpretation}} of {{Computer Programs}}},
|
||
author = {Abelson, Harold and Sussman, Gerald Jay and Sussman, Julie},
|
||
year = 1996,
|
||
edition = {2},
|
||
publisher = {MIT Press},
|
||
address = {Cambridge, Massachusetts, London, England},
|
||
urldate = {2024-03-29},
|
||
langid = {english},
|
||
file = {/Users/oscarplaisant/Zotero/storage/N2N5C3IC/Abelson et Sussman - Structure and Interpretation of Computer Programs.pdf}
|
||
}
|
||
|
||
@article{antoninPOURDESIGNMINIMAL,
|
||
title = {{POUR UN DESIGN MINIMAL}},
|
||
author = {Antonin, Peronnet},
|
||
langid = {french},
|
||
file = {/Users/oscarplaisant/Zotero/storage/SRGAVEY9/Antonin - POUR UN DESIGN MINIMAL.pdf}
|
||
}
|
||
|
||
@book{antonszandorBibleSatanique1969,
|
||
title = {La {{Bible}} Satanique},
|
||
author = {Anton Szandor, Lavey},
|
||
year = 1969,
|
||
file = {/Users/oscarplaisant/Zotero/storage/26CY4UD6/Anton Szandor - 1969 - La Bible satanique.pdf}
|
||
}
|
||
|
||
@article{AutomatePile2021,
|
||
title = {{Automate \`a pile}},
|
||
year = 2021,
|
||
month = oct,
|
||
journal = {Wikip\'edia},
|
||
urldate = {2024-03-31},
|
||
abstract = {Un automate \`a pile est une machine abstraite utilis\'ee en informatique th\'eorique et, plus pr\'ecis\'ement, en th\'eorie des automates. Un automate \`a pile est une g\'en\'eralisation des automates finis : il dispose en plus d'une m\'emoire infinie organis\'ee en pile (last-in/first-out ou LIFO). Un automate \`a pile prend en entr\'ee un mot et r\'ealise une s\'erie de transitions. Il effectue pour chaque lettre du mot une transition, dont le choix d\'epend de la lettre, de l'\'etat de l'automate et du sommet de la pile\,; il peut aussi modifier le contenu de la pile. Selon l'\'etat de l'automate et de la pile \`a la fin du calcul, le mot est accept\'e ou refus\'e. Les langages reconnus par les automates \`a piles sont exactement les langages alg\'ebriques, c'est-\`a-dire ceux engendr\'es par une grammaire alg\'ebrique. L'importance des automates \`a pile vient de leur emploi en analyse syntaxique des langages de programmation, et plus g\'en\'eralement dans la transformation de d\'efinitions ou d'algorithmes r\'ecursifs en leurs analogues it\'eratifs.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {french},
|
||
annotation = {Page Version ID: 187552887},
|
||
file = {/Users/oscarplaisant/Zotero/storage/U4AWEE48/Automate_à_pile.html}
|
||
}
|
||
|
||
@book{barbarasSpinozaScienceMathematique2007,
|
||
title = {{Spinoza : La science math\'ematique du salut}},
|
||
shorttitle = {{Spinoza}},
|
||
author = {Barbaras, Fran{\c c}oise},
|
||
year = 2007,
|
||
journal = {Spinoza : La science math\'ematique du salut},
|
||
series = {{CNRS Philosophie}},
|
||
publisher = {CNRS \'Editions},
|
||
address = {Paris},
|
||
urldate = {2026-04-24},
|
||
abstract = {<<~Je consid\'ererai les actions et les app\'etits humains comme s'il \'etait question de lignes, de surfaces et de solides. >> C'est une science de l'homme que construit Spinoza en ce d\'ebut du XVIIe~si\`ecle. Une science nourrie des bouleversements dans les math\'ematiques, l'alg\`ebre, la conception de l'infini. \'Ecrite sur le mod\`ele des \'El\'ements d'Euclide, l'\'Ethique n'a rien d'artificiel. Sa forme co\"incide, au contraire, avec la neuve radicalit\'e d'une pens\'ee qui donne au d\'esir toute sa puissance. Cette ambitieuse lecture de la philosophie de Spinoza comme science du salut engendre un app\'etit renouvel\'e de savoir.},
|
||
copyright = {https://www.openedition.org/12554},
|
||
isbn = {978-2-271-14198-9},
|
||
langid = {french},
|
||
keywords = {mathematique,salut,science,Spinoza}
|
||
}
|
||
|
||
@misc{begue-shanklandEtudeScientifiqueMontre2024,
|
||
title = {{Une \'etude scientifique montre que l'alcool est un facteur d\'eterminant des violences sexistes et sexuelles en milieu \'etudiant}},
|
||
author = {{B{\`e}gue-Shankland}, Laurent and Roch{\'e}, Sebastian and Arvers, Philippe},
|
||
year = 2024,
|
||
month = oct,
|
||
publisher = {Universit\'e de Grenobles Aples},
|
||
urldate = {2024-10-03},
|
||
abstract = {Men\'ee par le Professeur des Universit\'es Laurent B\`egue Shankland1 aupr\`es de 67 000 \'etudiant(e)s et \'el\`eves de grandes \'ecoles entre 2023 et 2024, cette recherche d'une ampleur in\'edite indique que l'alcool est pr\'esent dans plus de la moiti\'e des violences sexuelles rapport\'ees depuis l`arriv\'ee dans l`enseignement sup\'erieur.},
|
||
langid = {french},
|
||
file = {/Users/oscarplaisant/Zotero/storage/D8PFR6MQ/violences-sexuelles-dans-l-enseignement-sup-rieur-en-france-un-focus-sur-l-alcool-et-le-cannabis-34748.pdf;/Users/oscarplaisant/Zotero/storage/2TJ6E9MS/une-etude-scientifique-montre-que-l-alcool-est-un-facteur-determinant-des-violences-sexistes-et.html}
|
||
}
|
||
|
||
@misc{billaudProgrammationFonctionnelleSymbolique1989,
|
||
title = {Programmation {{Fonctionnelle}} et {{Symbolique}} - {{Introduction}}},
|
||
author = {Billaud, Michel},
|
||
year = 1989,
|
||
journal = {Page personnelle de Michel Billaud},
|
||
urldate = {2024-03-28},
|
||
howpublished = {https://www.mbillaud.fr/SITE-PERSO-LABRI/travaux/lisp89/1intro.html},
|
||
file = {/Users/oscarplaisant/Zotero/storage/YTQ7WHXP/1intro.html}
|
||
}
|
||
|
||
@article{brancatoCantorNotionInfinity2021,
|
||
title = {Cantor on the {{Notion}} of {{Infinity}} in {{Spinoza}} and {{Leibniz}}},
|
||
author = {Brancato, Mattia},
|
||
year = 2021,
|
||
journal = {Lumi\`eres},
|
||
volume = {3738},
|
||
number = {1},
|
||
pages = {131--147},
|
||
publisher = {Presses universitaires de Bordeaux},
|
||
issn = {1762-4630},
|
||
doi = {10.3917/lumi.037.0131},
|
||
urldate = {2026-03-31},
|
||
abstract = {In his analysis of the history of philosophy and mathematics, Cantor indicates the early modern period as the one in which, because of the general rejection of the notion of an infinite number, some major prejudices against his new ideas on infinity were developed. However, Spinoza and Leibniz are regarded also as the first authors possessing a correct notion of absolute infinity and actual infinity. After showing how Cantor came to this paradox, in this paper I argue that his views cannot be considered completely accurate: a precise superposition between Cantor's notion of transfinite number and the early moderns' infinite number is impossible, because there is a discrepancy in the notion of set that has not been taken into account. At the same time, Spinoza and Leibniz are under a certain aspect Cantor's precursors, because Cantor adopts Spinoza's terminology to distinguish between absolute infinity and the transfinite, and because Cantor's studies on Leibniz's calculus presented him an example of infinite wholes used in mathematics as an aid for new discoveries.},
|
||
langid = {english},
|
||
file = {/Users/oscarplaisant/Zotero/storage/5A4NKDVB/Brancato - 2021 - Cantor on the Notion of Infinity in Spinoza and Leibniz.pdf}
|
||
}
|
||
|
||
@article{brown10ThingsSoftware2023,
|
||
title = {10 {{Things Software Developers Should Learn}} about {{Learning}}},
|
||
author = {Brown, Neil C. C. and Hermans, Felienne F. J. and Margulieux, Lauren E.},
|
||
year = 2023,
|
||
month = dec,
|
||
journal = {Communications of the ACM},
|
||
volume = {67},
|
||
number = {1},
|
||
pages = {78--87},
|
||
issn = {0001-0782},
|
||
doi = {10.1145/3584859},
|
||
urldate = {2024-03-14},
|
||
abstract = {Understanding how human memory and learning works, the differences between beginners and experts, and practical steps developers can take to improve their learning, training, and recruitment.},
|
||
file = {/Users/oscarplaisant/Zotero/storage/PFX3S2NP/Brown et al. - 2023 - 10 Things Software Developers Should Learn about L.pdf}
|
||
}
|
||
|
||
@article{bustosRegretGenderaffirmationSurgery2021,
|
||
title = {Regret after {{Gender-affirmation Surgery}}: {{A Systematic Review}} and {{Meta-analysis}} of {{Prevalence}}},
|
||
shorttitle = {Regret after {{Gender-affirmation Surgery}}},
|
||
author = {Bustos, Valeria P. and Bustos, Samyd S. and Mascaro, Andres and Del Corral, Gabriel and Forte, Antonio J. and Ciudad, Pedro and Kim, Esther A. and Langstein, Howard N. and Manrique, Oscar J.},
|
||
year = 2021,
|
||
month = mar,
|
||
journal = {Plastic and Reconstructive Surgery Global Open},
|
||
volume = {9},
|
||
number = {3},
|
||
pages = {e3477},
|
||
issn = {2169-7574},
|
||
doi = {10.1097/GOX.0000000000003477},
|
||
urldate = {2024-05-14},
|
||
abstract = {Supplemental Digital Content is available in the text.},
|
||
pmcid = {PMC8099405},
|
||
pmid = {33968550},
|
||
file = {/Users/oscarplaisant/Zotero/storage/YBIKL4IK/Bustos et al. - 2021 - Regret after Gender-affirmation Surgery A Systematic Review and Meta-analysis of Prevalence.pdf}
|
||
}
|
||
|
||
@misc{cainLectureProgrammingParadigms2018,
|
||
title = {Lecture 1 \textbar{} {{Programming Paradigms}}},
|
||
author = {Cain, Jerry},
|
||
year = 2018,
|
||
month = jul,
|
||
address = {Stanford},
|
||
urldate = {2024-02-20},
|
||
langid = {english}
|
||
}
|
||
|
||
@article{camerini-lettre12,
|
||
title = {La {{Lettre XII}} et Ses Cercles Non-Concentriques},
|
||
author = {Camerini, Matteo},
|
||
urldate = {2026-04-24},
|
||
file = {/Users/oscarplaisant/Zotero/storage/L2ACE6DK/Camerini - La Lettre XII et ses cercles non-concentriques.pdf}
|
||
}
|
||
|
||
@misc{chenQazxcdswe123Searchobsidiangoogle2024,
|
||
title = {Qazxcdswe123/Search-Obsidian-in-Google},
|
||
author = {Chen, YuNing},
|
||
year = 2024,
|
||
month = jul,
|
||
urldate = {2025-01-14},
|
||
abstract = {Search obsidian notes in google.},
|
||
copyright = {GPL-3.0}
|
||
}
|
||
|
||
@article{ComparisonMultiparadigmProgramming2024,
|
||
title = {Comparison of Multi-Paradigm Programming Languages},
|
||
year = 2024,
|
||
month = feb,
|
||
journal = {Wikipedia},
|
||
urldate = {2024-02-20},
|
||
abstract = {Programming languages can be grouped by the number and types of paradigms supported.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {english},
|
||
annotation = {Page Version ID: 1202029082},
|
||
file = {/Users/oscarplaisant/Zotero/storage/D25X5928/Comparison_of_multi-paradigm_programming_languages.html}
|
||
}
|
||
|
||
@article{ComparisonProgrammingParadigms2024,
|
||
title = {Comparison of Programming Paradigms},
|
||
year = 2024,
|
||
month = feb,
|
||
journal = {Wikipedia},
|
||
urldate = {2024-02-26},
|
||
abstract = {This article attempts to set out the various similarities and differences between the various programming paradigms as a summary in both graphical and tabular format with links to the separate discussions concerning these similarities and differences in extant Wikipedia articles.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {english},
|
||
annotation = {Page Version ID: 1202049782},
|
||
file = {/Users/oscarplaisant/Zotero/storage/SXQUITDX/Comparison_of_programming_paradigms.html}
|
||
}
|
||
|
||
@book{coriLogiqueMathematique12003,
|
||
title = {Logique Math\'ematique 1. Calcul Propositionnel, Alg\`ebre de Boole},
|
||
author = {Cori, Ren{\'e} and Lascar, Daniel},
|
||
year = 2003,
|
||
volume = {1},
|
||
publisher = {Dunod},
|
||
address = {paris},
|
||
file = {/Users/oscarplaisant/Zotero/storage/7AV9J23S/_.pdf}
|
||
}
|
||
|
||
@book{coriLogiqueMathematique22003,
|
||
title = {Logique Math\'ematique 2. Fonctions R\'ecursives, Th\'eor\`eme de {{G\"odel}}, Th\'eories Des Ensembles, Th\'eorie Des Mod\`eles},
|
||
author = {Cori, Ren{\'e} and Lascar, Daniel},
|
||
year = 2003,
|
||
volume = {2},
|
||
publisher = {Dunod},
|
||
address = {paris},
|
||
file = {/Users/oscarplaisant/Zotero/storage/TIYJ2E7F/Cori et Lascar - 2003 - Logique mathématique 1. calcul propositionnel, algèbre de boole.pdf}
|
||
}
|
||
|
||
@article{CountingSort2024,
|
||
title = {Counting Sort},
|
||
year = 2024,
|
||
month = feb,
|
||
journal = {Wikipedia},
|
||
urldate = {2024-05-12},
|
||
abstract = {In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small positive integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that possess distinct key values, and applying prefix sum on those counts to determine the positions of each key value in the output sequence. Its running time is linear in the number of items and the difference between the maximum key value and the minimum key value, so it is only suitable for direct use in situations where the variation in keys is not significantly greater than the number of items. It is often used as a subroutine in radix sort, another sorting algorithm, which can handle larger keys more efficiently. Counting sort is not a comparison sort; it uses key values as indexes into an array and the \textohm (n log n) lower bound for comparison sorting will not apply. Bucket sort may be used in lieu of counting sort, and entails a similar time analysis. However, compared to counting sort, bucket sort requires linked lists, dynamic arrays, or a large amount of pre-allocated memory to hold the sets of items within each bucket, whereas counting sort stores a single number (the count of items) per bucket.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {english},
|
||
annotation = {Page Version ID: 1205345660},
|
||
file = {/Users/oscarplaisant/Zotero/storage/9RC9IDRE/Counting_sort.html}
|
||
}
|
||
|
||
@article{dahanRelationsEntreScience2015,
|
||
title = {{Les relations entre science et politique dans le r\'egime climatique : \`a la recherche d'un nouveau mod\`ele d'expertise ?}},
|
||
shorttitle = {{Les relations entre science et politique dans le r\'egime climatique}},
|
||
author = {Dahan, Amy and Guillemot, H{\'e}l{\`e}ne},
|
||
year = 2015,
|
||
journal = {Natures Sciences Soci\'et\'es},
|
||
volume = {23},
|
||
pages = {S6-S18},
|
||
publisher = {EDP Sciences},
|
||
issn = {1240-1307, 1765-2979},
|
||
doi = {10.1051/nss/2015014},
|
||
urldate = {2024-05-13},
|
||
abstract = {Depuis vingt-cinq ans, le changement climatique anthropog\'enique est appr\'ehend\'e comme une question d'environnement global. Les sciences du climat jouent un r\^ole primordial dans la construction du probl\`eme, qui se veut r\'esum\'e par la formule << \emph{science speaks truth to power{$<$}i/{$>$} >>, science et politique \'etant suppos\'ees s\'epar\'ees et \'etanches. Ce cadrage jusqu'ici dominant est aujourd'hui \'ebranl\'e par l'\'echec des n\'egociations internationales : il est devenu manifeste que le consensus scientifique ne suffit pas \`a engendrer des d\'ecisions politiques globales significatives. \`A l'heure de la COP de Paris, alors que se discute la n\'ecessit\'e de changer de paradigme dans la n\'egociation, cet article veut s'interroger sur l'\'evolution des relations entre science et politique dans le r\'egime climatique, en revenant sur la vision du r\^ole de la science et en \'evoquant les critiques, propositions et perspectives qui se dessinent \`a propos des mod\`eles d'expertise.}},
|
||
copyright = {\copyright ~NSS-Dialogues, EDP Sciences 2015},
|
||
langid = {french},
|
||
file = {/Users/oscarplaisant/Zotero/storage/9IEGNQND/Dahan et Guillemot - 2015 - Les relations entre science et politique dans le régime climatique à la recherche d’un nouveau mod.pdf}
|
||
}
|
||
|
||
@incollection{dijkstraChapterNotesStructured1972,
|
||
title = {Chapter {{I}}: {{Notes}} on Structured Programming},
|
||
shorttitle = {Chapter {{I}}},
|
||
booktitle = {Structured Programming},
|
||
author = {Dijkstra, Edsger W.},
|
||
year = 1972,
|
||
month = jan,
|
||
pages = {1--82},
|
||
publisher = {Academic Press Ltd.},
|
||
address = {GBR},
|
||
urldate = {2024-04-01},
|
||
isbn = {978-0-12-200550-3},
|
||
file = {/Users/oscarplaisant/Zotero/storage/KKZLUW7P/Dijkstra - 1972 - Chapter I Notes on structured programming.pdf}
|
||
}
|
||
|
||
@article{EffetBordInformatique2023,
|
||
title = {{Effet de bord (informatique)}},
|
||
year = 2023,
|
||
month = aug,
|
||
journal = {Wikip\'edia},
|
||
urldate = {2024-03-28},
|
||
abstract = {En informatique, une fonction est dite \`a effet de bord (traduction mot \`a mot de l'anglais side effect, dont le sens est plus proche d'effet secondaire) si elle modifie un \'etat en dehors de son environnement local, c'est-\`a-dire a une interaction observable avec le monde ext\'erieur autre que retourner une valeur. Par exemple, les fonctions qui modifient une variable locale statique, une variable non locale ou un argument mutable pass\'e par r\'ef\'erence, les fonctions qui effectuent des op\'erations d'entr\'ees-sorties ou les fonctions appelant d'autres fonctions \`a effet de bord. Souvent, ces effets compliquent la lisibilit\'e du comportement des programmes et/ou nuisent \`a la r\'eutilisabilit\'e des fonctions et proc\'edures. Un langage comme Haskell les restreint d\'elib\'er\'ement dans des composants nomm\'es monades. Plus commun\'ement, un effet de bord appara\^it la plupart du temps lorsqu'une modification d'un programme coh\'erent (valeurs et \'etats pris conformes aux sp\'ecifications) aboutit \`a des valeurs ou des comportements non pr\'evus, \`a cause de la non prise en compte de la port\'ee, de l'ensemble de d\'efinition de variables, ou du contrat des fonctions.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {french},
|
||
annotation = {Page Version ID: 207397507},
|
||
file = {/Users/oscarplaisant/Zotero/storage/GVWX3BJ9/Effet_de_bord_(informatique).html}
|
||
}
|
||
|
||
@article{EnregistrementStructureDonnees2023,
|
||
title = {{Enregistrement (structure de donn\'ees)}},
|
||
year = 2023,
|
||
month = sep,
|
||
journal = {Wikip\'edia},
|
||
urldate = {2024-03-28},
|
||
abstract = {En programmation, un enregistrement est une structure de donn\'ees qui rassemble plusieurs champs, ceux-ci contenant des valeurs qui peuvent \^etre de types diff\'erents. Typiquement, le nombre de champ et leur s\'equence sont fix\'es. Les champs d'un enregistrement peuvent aussi \^etre nomm\'es "membres", en particulier dans la programmation orient\'ee objet. Les champs peuvent encore \^etre appel\'es "\'el\'ements", mais cela entra\^ine un risque de confusion avec les \'el\'ements d'une collection. Par exemple, une date peut \^etre stock\'ee en m\'emoire comme un enregistrement avec un champ num\'erique ann\'ee, le mois repr\'esent\'e comme une cha\^ine de caract\`eres, et un champ num\'erique pour le jour-du-mois. Les enregistrements se distinguent des tableaux (arrays) par le fait que le nombre de leurs champs est g\'en\'eralement fix\'e, que chaque champ a un nom et que chaque champ peut \^etre de type diff\'erent. Un type enregistrement est un type de donn\'ee qui d\'ecrit de telles variables. La majorit\'e des langages de programmation utilis\'es aujourd'hui donne au programmeur la capacit\'e de d\'efinir de nouveaux types d'enregistrements. La d\'efinition comprend la sp\'ecification du type de donn\'ees de chaque champ et un identifiant (nom ou \'etiquette) par lequel on peut y acc\'eder. Les enregistrements peuvent exister dans n'importe quelle forme de stockage de donn\'ees (m\'emoire vive, bandes magn\'etiques, disques durs...). Les enregistrements sont fondamentaux pour la majorit\'e des structures de donn\'ees, en particulier les structures de donn\'ees li\'ees. Un objet dans la programmation orient\'ee objet est essentiellement un enregistrement qui contient les proc\'edures sp\'ecialis\'ees pour cet enregistrement. Dans la majorit\'e des langages orient\'es objet, les enregistrements sont des cas sp\'ecifiques des objets, et sont nomm\'es plain old data structures, ou passive data structures. Un enregistrement peut \^etre consid\'er\'e comme l'\'equivalent informatique d'un n-uplet math\'ematique. Dans la m\^eme veine, il peut aussi \^etre vu comme une version technologique d'un produit cart\'esien de deux ou plusieurs ensembles math\'ematiques.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {french},
|
||
annotation = {Page Version ID: 207783466},
|
||
file = {/Users/oscarplaisant/Zotero/storage/8NYEP2J2/Enregistrement_(structure_de_données).html}
|
||
}
|
||
|
||
@misc{entwanneVariablesScopesClosures2019,
|
||
type = {{text}},
|
||
title = {{Variables, scopes et closures en Python}},
|
||
author = {{entwanne}},
|
||
year = 2019,
|
||
month = jul,
|
||
journal = {Zeste de Savoir},
|
||
publisher = {Zeste de Savoir},
|
||
urldate = {2024-05-13},
|
||
abstract = {Comprendre leur fonctionnement et en \'eviter les pi\`eges},
|
||
chapter = {Tutoriels},
|
||
copyright = {Licence CC BY},
|
||
howpublished = {https://zestedesavoir.com/tutoriels/3163/variables-scopes-et-closures-en-python/},
|
||
langid = {french},
|
||
file = {/Users/oscarplaisant/Zotero/storage/NT8374CI/variables-scopes-et-closures-en-python.html}
|
||
}
|
||
|
||
@book{ethique-rovere,
|
||
title = {{\'Ethique}},
|
||
author = {Spinoza},
|
||
year = 2021,
|
||
month = nov,
|
||
edition = {Maxime Rovere},
|
||
publisher = {Flammarion},
|
||
address = {Paris},
|
||
urldate = {2026-04-24},
|
||
isbn = {978-2-08-151383-9},
|
||
langid = {french}
|
||
}
|
||
|
||
@article{ExpressivePowerComputer2023,
|
||
title = {Expressive Power (Computer Science)},
|
||
year = 2023,
|
||
month = aug,
|
||
journal = {Wikipedia},
|
||
urldate = {2024-03-28},
|
||
abstract = {In computer science, the expressive power (also called expressiveness or expressivity) of a language is the breadth of ideas that can be represented and communicated in that language. The more expressive a language is, the greater the variety and quantity of ideas it can be used to represent. For example, the Web Ontology Language expression language profile (OWL2 EL) lacks ideas (such as negation) that can be expressed in OWL2 RL (rule language). OWL2 EL may therefore be said to have less expressive power than OWL2 RL. These restrictions allow for more efficient (polynomial time) reasoning in OWL2 EL than in OWL2 RL. So OWL2 EL trades some expressive power for more efficient reasoning (processing of the knowledge representation language).},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {english},
|
||
annotation = {Page Version ID: 1172391643},
|
||
file = {/Users/oscarplaisant/Zotero/storage/FYTJ7BCA/Expressive_power_(computer_science).html}
|
||
}
|
||
|
||
@incollection{felleisenExpressivePowerProgramming1990,
|
||
title = {On the Expressive Power of Programming Languages},
|
||
booktitle = {{{ESOP}} '90},
|
||
author = {Felleisen, Matthias},
|
||
editor = {Goos, G. and Hartmanis, J. and Barstow, D. and Brauer, W. and Brinch Hansen, P. and Gries, D. and Luckham, D. and Moler, C. and Pnueli, A. and Seegm{\"u}ller, G. and Stoer, J. and Wirth, N. and Jones, Neil},
|
||
year = 1990,
|
||
volume = {432},
|
||
pages = {134--151},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
address = {Berlin, Heidelberg},
|
||
doi = {10.1007/3-540-52592-0_60},
|
||
urldate = {2024-02-20},
|
||
isbn = {978-3-540-52592-9 978-3-540-47045-8},
|
||
file = {/Users/oscarplaisant/Zotero/storage/Z4AXP3TP/Felleisen - 1990 - On the expressive power of programming languages.pdf}
|
||
}
|
||
|
||
@article{felleisenProgrammableProgrammingLanguage2018,
|
||
title = {A Programmable Programming Language},
|
||
author = {Felleisen, Matthias and Findler, Robert Bruce and Flatt, Matthew and Krishnamurthi, Shriram and Barzilay, Eli and McCarthy, Jay and {Tobin-Hochstadt}, Sam},
|
||
year = 2018,
|
||
month = feb,
|
||
journal = {Communications of the ACM},
|
||
volume = {61},
|
||
number = {3},
|
||
pages = {62--71},
|
||
issn = {0001-0782, 1557-7317},
|
||
doi = {10.1145/3127323},
|
||
urldate = {2024-02-26},
|
||
abstract = {As the software industry enters the era of language-oriented programming, it needs programmable programming languages.},
|
||
langid = {english},
|
||
file = {/Users/oscarplaisant/Zotero/storage/RD8Q7CER/Felleisen et al. - 2018 - A programmable programming language.pdf}
|
||
}
|
||
|
||
@article{FermetureInformatique2024,
|
||
title = {{Fermeture (informatique)}},
|
||
year = 2024,
|
||
month = feb,
|
||
journal = {Wikip\'edia},
|
||
urldate = {2024-03-31},
|
||
abstract = {Dans un langage de programmation, une fermeture ou cl\^oture (en anglais : closure) est une fonction accompagn\'ee de son environnement lexical. L'environnement lexical d'une fonction est l'ensemble des variables non locales qu'elle a captur\'ees, soit par valeur (c'est-\`a-dire par copie des valeurs des variables), soit par r\'ef\'erence (c'est-\`a-dire par copie des adresses m\'emoires des variables). Une fermeture est donc cr\'e\'ee, entre autres, lorsqu'une fonction est d\'efinie dans le corps d'une autre fonction et utilise des param\`etres ou des variables locales de cette derni\`ere. Une fermeture peut \^etre pass\'ee en argument d'une fonction dans l'environnement o\`u elle a \'et\'e cr\'e\'ee (pass\'ee vers le bas) ou renvoy\'ee comme valeur de retour (pass\'ee vers le haut). Dans ce cas, le probl\`eme pos\'e alors par la fermeture est qu'elle fait r\'ef\'erence \`a des donn\'ees qui auraient typiquement \'et\'e allou\'ees sur la pile d'ex\'ecution et lib\'er\'ees \`a la sortie de l'environnement. Hors optimisations par le compilateur, le probl\`eme est g\'en\'eralement r\'esolu par une allocation sur le tas de l'environnement.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {french},
|
||
annotation = {Page Version ID: 212836844},
|
||
file = {/Users/oscarplaisant/Zotero/storage/M8ICDQZ2/Fermeture_(informatique).html}
|
||
}
|
||
|
||
@article{floydParadigmsProgramming1979,
|
||
title = {The Paradigms of Programming},
|
||
author = {Floyd, Robert W.},
|
||
year = 1979,
|
||
month = aug,
|
||
journal = {Communication of the ACM},
|
||
volume = {22},
|
||
number = {8},
|
||
pages = {455--460},
|
||
doi = {10.1145/359138.359140},
|
||
langid = {english}
|
||
}
|
||
|
||
@article{floydParadigmsProgramming1979a,
|
||
title = {The Paradigms of Programming},
|
||
author = {Floyd, Robert W},
|
||
year = 1979,
|
||
volume = {22},
|
||
number = {8},
|
||
langid = {english},
|
||
file = {/Users/oscarplaisant/Zotero/storage/8RQ7DU6W/Floyd - 1979 - The paradigms of programming.pdf}
|
||
}
|
||
|
||
@article{FonctionOrdreSuperieur2023,
|
||
title = {{Fonction d'ordre sup\'erieur}},
|
||
year = 2023,
|
||
month = jun,
|
||
journal = {Wikip\'edia},
|
||
urldate = {2024-03-31},
|
||
abstract = {En math\'ematiques et en informatique, les fonctions d'ordre sup\'erieur sont des fonctions qui ont au moins une des propri\'et\'es suivantes : elles prennent une ou plusieurs fonctions en entr\'ee ; elles renvoient une fonction.En math\'ematiques, on les appelle des op\'erateurs ou des fonctionnelles. L'op\'erateur de d\'erivation en calcul infinit\'esimal est un exemple classique, car elle associe une fonction (la d\'eriv\'ee) \`a une autre fonction (la fonction que l'on d\'erive). Dans le lambda-calcul non typ\'e, toutes les fonctions sont d'ordre sup\'erieur. Dans le lambda-calcul typ\'e, dont la plupart des langages de programmation fonctionnels sont issus, les fonctions d'ordre sup\'erieur sont g\'en\'eralement celles dont le type contient plus d'une fl\`eche (Fl\`eches dans la programmation fonctionnelle). En programmation fonctionnelle, les fonctions d'ordre sup\'erieur qui retournent d'autres fonctions sont dites curryfi\'ees. La fonction map pr\'esente dans de nombreux langages de programmation fonctionnelle est un exemple de fonction d'ordre sup\'erieur. Elle prend une fonction f comme argument, et retourne une nouvelle fonction qui prend une liste comme argument et applique f \`a chaque \'el\'ement. Un autre exemple tr\`es courant est celui d'une fonction de tri qui prend en argument une fonction de comparaison ; on s\'epare ainsi l'algorithme de tri de la comparaison des \'el\'ements \`a trier. D'autres exemples de fonction d'ordre sup\'erieur sont la composition de fonctions et l'int\'egration.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {french},
|
||
annotation = {Page Version ID: 205383055},
|
||
file = {/Users/oscarplaisant/Zotero/storage/6SVBHVEU/Fonction_d'ordre_supérieur.html}
|
||
}
|
||
|
||
@article{FunctionComputerProgramming2024,
|
||
title = {Function (Computer Programming)},
|
||
year = 2024,
|
||
month = feb,
|
||
journal = {Wikipedia},
|
||
urldate = {2024-04-01},
|
||
abstract = {In computer programming, a function, subprogram, procedure, method, routine or subroutine is a callable unit that has a well-defined behavior and can be invoked by other software units to exhibit that behavior. Callable units provide a powerful programming tool. The primary purpose is to allow for the decomposition of a large and/or complicated problem into chunks that have relatively low cognitive load and to assign the chunks meaningful names (unless they are anonymous). Judicious application can reduce the cost of developing and maintaining software, while increasing its quality and reliability.Callable units are present at multiple levels of abstraction in the programming environment. For example, a programmer may write a function in source code that is compiled to machine code that implements similar semantics. There is a callable unit in the source code and an associated one in the machine code, but they are different kinds of callable units -- with different implications and features.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {english},
|
||
annotation = {Page Version ID: 1210403496},
|
||
file = {/Users/oscarplaisant/Zotero/storage/M2MM4EWS/Function_(computer_programming).html}
|
||
}
|
||
|
||
@article{Gcode2023,
|
||
title = {G-Code},
|
||
year = 2023,
|
||
month = dec,
|
||
journal = {Wikipedia},
|
||
urldate = {2024-04-01},
|
||
abstract = {G-code (also RS-274) is the most widely used computer numerical control (CNC) and 3D printing programming language. It is used mainly in computer-aided manufacturing to control automated machine tools, as well as for 3D-printer slicer applications. The G stands for geometry. G-code has many variants. G-code instructions are provided to a machine controller (industrial computer) that tells the motors where to move, how fast to move, and what path to follow. The two most common situations are that, within a machine tool such as a lathe or mill, a cutting tool is moved according to these instructions through a toolpath cutting away material to leave only the finished workpiece and/or an unfinished workpiece is precisely positioned in any of up to nine axes around the three dimensions relative to a toolpath and, either or both can move relative to each other. The same concept also extends to noncutting tools such as forming or burnishing tools, photoplotting, additive methods such as 3D printing, and measuring instruments.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {english},
|
||
annotation = {Page Version ID: 1192191622},
|
||
file = {/Users/oscarplaisant/Zotero/storage/3JTC97YD/G-code.html}
|
||
}
|
||
|
||
@article{GrammaireNonContextuelle2023,
|
||
title = {{Grammaire non contextuelle}},
|
||
year = 2023,
|
||
month = dec,
|
||
journal = {Wikip\'edia},
|
||
urldate = {2024-03-31},
|
||
abstract = {En linguistique et en informatique th\'eorique, une grammaire alg\'ebrique, ou grammaire non contextuelle, aussi appel\'ee grammaire hors-contexte ou grammaire << context-free >> est une grammaire formelle dans laquelle chaque r\`egle de production est de la forme X{$\rightarrow\alpha$}\textbraceleft\textbackslash displaystyle X\textbackslash to \textbackslash alpha \textbraceright o\`u X\textbraceleft\textbackslash displaystyle X\textbraceright{} est un symbole non terminal et {$\alpha$}\textbraceleft\textbackslash displaystyle \textbackslash alpha \textbraceright{} est une cha\^ine compos\'ee de terminaux et/ou de non-terminaux. Le terme << non contextuel >> provient du fait qu'un non terminal X\textbraceleft\textbackslash displaystyle X\textbraceright{} peut \^etre remplac\'e par {$\alpha$}\textbraceleft\textbackslash displaystyle \textbackslash alpha \textbraceright, sans tenir compte du contexte o\`u il appara\^it. Un langage formel est non contextuel (ou hors contexte, ou encore alg\'ebrique) s'il existe une grammaire non contextuelle qui l'engendre. Par opposition est contextuelle une r\`egle de la forme c +X{$\rightarrow$}c+{$\alpha$}\textbraceleft\textbackslash displaystyle c\textasciitilde +X\textbackslash to c+\textbackslash alpha \textbraceright{} en raison de la partie gauche de la r\`egle qui stipule un contexte pour X. Une telle r\`egle signifie que X, dans le cas (contexte) o\`u il est pr\'ec\'ed\'e du symbole terminal c\textbraceleft\textbackslash displaystyle c\textbraceright{} et du litt\'eral +\textbraceleft\textbackslash displaystyle +\textbraceright, peut \^etre remplac\'e par {$\alpha$}\textbraceleft\textbackslash displaystyle \textbackslash alpha \textbraceright. Ainsi, dans une grammaire non contextuelle, un symbole non terminal est toujours seul dans la partie gauche de toute r\`egle, ce qui signifie que son environnement syntaxique (ou contexte) n'est pas consid\'er\'e. Les grammaires alg\'ebriques sont suffisamment puissantes pour d\'ecrire la partie principale de la syntaxe de la plupart des langages de programmation, avec au besoin quelques extensions. La forme de Backus-Naur est la notation la plus commun\'ement utilis\'ee pour d\'ecrire une grammaire non contextuelle d\'ecrivant un langage de programmation. Dans la hi\'erarchie de Chomsky, ces grammaires sont de type 2. Si on trouve plusieurs termes pour nommer une grammaire alg\'ebrique, c'est que le terme anglais << context-free >> est malcommode \`a traduire. Tous les termes donn\'es plus haut sont employ\'es et \'equivalents.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {french},
|
||
annotation = {Page Version ID: 210452959},
|
||
file = {/Users/oscarplaisant/Zotero/storage/VMD6L3JW/index.html}
|
||
}
|
||
|
||
@article{HierarchieChomsky2023,
|
||
title = {{Hi\'erarchie de Chomsky}},
|
||
year = 2023,
|
||
month = dec,
|
||
journal = {Wikip\'edia},
|
||
urldate = {2024-03-31},
|
||
abstract = {En informatique th\'eorique, en th\'eorie des langages, et en calculabilit\'e, la hi\'erarchie de Chomsky (parfois appel\'ee hi\'erarchie de Chomsky-Sch\"utzenberger) est une classification des grammaires formelles (et par extension, des langages formels respectifs engendr\'es par les grammaires), esquiss\'ee par Noam Chomsky en 1956, et d\'ecrite de fa\c con formelle en 1959.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {french},
|
||
annotation = {Page Version ID: 210331079},
|
||
file = {/Users/oscarplaisant/Zotero/storage/95WDCETM/Hiérarchie_de_Chomsky.html}
|
||
}
|
||
|
||
@inproceedings{hofmannWhatPureFunctional2010,
|
||
title = {What {{Is}} a {{Pure Functional}}?},
|
||
booktitle = {Automata, {{Languages}} and {{Programming}}},
|
||
author = {Hofmann, Martin and Karbyshev, Aleksandr and Seidl, Helmut},
|
||
editor = {Abramsky, Samson and Gavoille, Cyril and Kirchner, Claude and {Meyer auf der Heide}, Friedhelm and Spirakis, Paul G.},
|
||
year = 2010,
|
||
pages = {199--210},
|
||
publisher = {Springer},
|
||
address = {Berlin, Heidelberg},
|
||
doi = {10.1007/978-3-642-14162-1_17},
|
||
abstract = {Given an ML function f : (int-{$>$}int)-{$>$}int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its functional argument? We show that existing methods based on preservation of invariants and relational parametricity are insufficient for this purpose and thus define a new notion that captures purity in the sense that for any functional F that is pure in this sense there exists a corresponding question-answer strategy. This research is motivated by an attempt to prove algorithms correct that take such supposedly pure functionals as input and apply them to stateful arguments in order to inspect intensional aspects of their behaviour.},
|
||
isbn = {978-3-642-14162-1},
|
||
langid = {english},
|
||
file = {/Users/oscarplaisant/Zotero/storage/4WFTZD5E/Hofmann et al. - 2010 - What Is a Pure Functional.pdf}
|
||
}
|
||
|
||
@article{hughesWhyFunctionalProgramming1989,
|
||
title = {Why {{Functional Programming Matters}}},
|
||
author = {Hughes, J.},
|
||
year = 1989,
|
||
month = jan,
|
||
journal = {The Computer Journal},
|
||
volume = {32},
|
||
number = {2},
|
||
pages = {98--107},
|
||
issn = {0010-4620},
|
||
doi = {10.1093/comjnl/32.2.98},
|
||
urldate = {2024-03-30},
|
||
abstract = {As software becomes more and more complex, it is more and more important to structure it well. Well-structured software is easy to write, easy to debug, and provides a collection of modules that can be re-used to reduce future programming costs. Conventional languages place conceptual limits on the way problems can be modularised. Functional languages push those limits back. In this paper we show that two features of functional languages in particular, higher-order functions and lazy evaluation, can contribute greatly to modularity. As examples, we manipulate lists and trees, program several numerical algorithms, and implement the alpha-beta heuristics (an Artificial Intelligence algorithm used in game-playing programs). Since modularity is the key to successful programming, functional languages are vitally important to the real world.},
|
||
file = {/Users/oscarplaisant/Zotero/storage/ARFZTMBK/Hughes - 1989 - Why Functional Programming Matters.pdf}
|
||
}
|
||
|
||
@article{iversonNotationToolThought1980,
|
||
title = {Notation as a Tool of Thought},
|
||
author = {Iverson, Kenneth E.},
|
||
year = 1980,
|
||
month = aug,
|
||
journal = {Communications of the ACM},
|
||
volume = {23},
|
||
number = {8},
|
||
pages = {444--465},
|
||
issn = {0001-0782, 1557-7317},
|
||
doi = {10.1145/358896.358899},
|
||
urldate = {2024-02-20},
|
||
langid = {english},
|
||
file = {/Users/oscarplaisant/Zotero/storage/RXMPWFAF/Iverson - 1980 - Notation as a tool of thought.pdf}
|
||
}
|
||
|
||
@misc{jeambonFaceLIA2024,
|
||
title = {Face a l'{{IA}}},
|
||
author = {Jeambon, Val{\'e}rie and Devouard, Florence},
|
||
year = 2024,
|
||
file = {/Users/oscarplaisant/Zotero/storage/PNG64A87/FACE A L IA V3.pdf}
|
||
}
|
||
|
||
@misc{jenkinsWhatFunctionalProgramming2015,
|
||
title = {What {{Is Functional Programming}}?},
|
||
author = {Jenkins, Kris},
|
||
year = 2015,
|
||
month = dec,
|
||
journal = {Kris Jenkins' Blog},
|
||
urldate = {2024-03-29},
|
||
abstract = {The personal blog of Kris Jenkins, geek.},
|
||
howpublished = {http://blog.jenkster.com/2015/12/what-is-functional-programming.html\#fnref-1},
|
||
langid = {english},
|
||
file = {/Users/oscarplaisant/Zotero/storage/767E3XLT/what-is-functional-programming.html}
|
||
}
|
||
|
||
@article{linEffectsWhiteNoise2022,
|
||
title = {The {{Effects}} of {{White Noise}} on {{Attentional Performance}} and {{On-Task Behaviors}} in {{Preschoolers}} with {{ADHD}}},
|
||
author = {Lin, Hung-Yu},
|
||
year = 2022,
|
||
month = jan,
|
||
journal = {International Journal of Environmental Research and Public Health},
|
||
volume = {19},
|
||
number = {22},
|
||
pages = {15391},
|
||
issn = {1660-4601},
|
||
doi = {10.3390/ijerph192215391},
|
||
urldate = {2024-10-29},
|
||
abstract = {Several models have tentatively associated improving attention-deficit/hyperactivity disorder (ADHD) symptoms with arousal and external environmental stimulation. In order to further clarify the relationships between ADHD symptoms, arousal, and external stimulation, this study focused on exploring the ``simultaneous'' effects of white noise on intrinsic attentional performance and extrinsic on-task behaviors in preschoolers with and without ADHD. By using the computerized task (K-CPT 2), 104 preschoolers, including 52 ADHD children and 52 typically developing (TD) children, were tested and analyzed for their intrinsic attention (such as detectability, omission errors, commission errors, and reaction time). Simultaneously, these preschoolers' external on-task behaviors were recorded for analysis through systematic observation. This study showed that white noise could effectively improve attention performance, including enhancing the ability to differentiate non-targets from targets and decreasing omission errors. It could also reduce the extrinsic hyperactive behaviors of preschoolers with ADHD. The findings of this study highlighted that white noise stimulation is a beneficial non-pharmacological treatment for preschoolers with ADHD. In contrast, for TD preschoolers, the results of this study showed that the external white noise stimuli were not only unhelpful but also a burden.},
|
||
copyright = {http://creativecommons.org/licenses/by/3.0/},
|
||
langid = {english},
|
||
keywords = {ADHD,arousal,attention,hyperactivity,white noise},
|
||
file = {/Users/oscarplaisant/Zotero/storage/XBDDXXFD/Lin - 2022 - The Effects of White Noise on Attentional Performa.pdf}
|
||
}
|
||
|
||
@article{LogiqueCombinatoire2023,
|
||
title = {{Logique combinatoire}},
|
||
year = 2023,
|
||
month = jun,
|
||
journal = {Wikip\'edia},
|
||
urldate = {2024-04-01},
|
||
abstract = {En logique math\'ematique, la logique combinatoire est une th\'eorie logique introduite par Moses Sch\"onfinkel en 1920 lors d'une conf\'erence[Laquelle ?] et d\'evelopp\'ee d\`es 1929 par Haskell Brooks Curry pour supprimer le besoin de variables en math\'ematiques, pour formaliser rigoureusement la notion de fonction et pour minimiser le nombre d'op\'erateurs n\'ecessaires pour d\'efinir le calcul des pr\'edicats \`a la suite de Henry M. Sheffer. Plus r\'ecemment, elle a \'et\'e utilis\'ee en informatique comme mod\`ele th\'eorique de calcul et comme base pour la conception de langages de programmation fonctionnels. Le concept de base de la logique combinatoire est celui de combinateur qui est une fonction d'ordre sup\'erieur ; elle utilise uniquement l'application de fonctions et \'eventuellement d'autres combinateurs pour d\'efinir de nouvelles fonctions d'ordre sup\'erieur. Chaque combinateur simplement typable est une d\'emonstration \`a la Hilbert en logique intuitionniste et vice-versa . On appelle ceci la correspondance de Curry-Howard},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {french},
|
||
annotation = {Page Version ID: 204935023},
|
||
file = {/Users/oscarplaisant/Zotero/storage/LFVBZV8U/Logique_combinatoire.html}
|
||
}
|
||
|
||
@article{marxCapitalParKarl,
|
||
title = {{Le capital / par Karl Marx ; traduction de M. J. Roy, enti\`erement revis\'ee par l'auteur}},
|
||
author = {Marx, Karl (1818-1883)},
|
||
langid = {french},
|
||
file = {/Users/oscarplaisant/Zotero/storage/2D5SMTTY/f1n351.pdf}
|
||
}
|
||
|
||
@misc{merakchiAtheismMoralityWe2024,
|
||
title = {Atheism and Morality: Do We Need {{God}} to Be Moral?},
|
||
shorttitle = {Atheism and Morality},
|
||
author = {Merakchi, Hiba},
|
||
year = 2024,
|
||
month = feb,
|
||
journal = {Medium},
|
||
urldate = {2024-06-23},
|
||
abstract = {Unless you've been failing your CAPTCHA tests lately, I'll venture to boldly claim: you are a human. And while some may argue that the\dots},
|
||
langid = {english},
|
||
file = {/Users/oscarplaisant/Zotero/storage/PYH5EDV8/atheism-and-morality-do-we-need-god-to-be-moral-7dd51d28f640.html}
|
||
}
|
||
|
||
@misc{merakchiHardProblemConsciousness2021,
|
||
title = {The Hard Problem of Consciousness},
|
||
author = {Merakchi, Hiba},
|
||
year = 2021,
|
||
month = dec,
|
||
journal = {Medium},
|
||
urldate = {2024-06-18},
|
||
abstract = {Can materialism account for consciousness?},
|
||
langid = {english},
|
||
file = {/Users/oscarplaisant/Zotero/storage/QEN7G3X4/the-hard-problem-of-consciousness-6457d3be84de.html}
|
||
}
|
||
|
||
@article{michaelsonProgrammingParadigmsTuring2020,
|
||
title = {Programming {{Paradigms}}, {{Turing Completeness}} and {{Computational Thinking}}},
|
||
author = {Michaelson, Greg},
|
||
year = 2020,
|
||
month = feb,
|
||
journal = {The Art, Science, and Engineering of Programming},
|
||
volume = {4},
|
||
number = {3},
|
||
eprint = {2002.06178},
|
||
primaryclass = {cs},
|
||
pages = {4},
|
||
issn = {2473-7321},
|
||
doi = {10.22152/programming-journal.org/2020/4/4},
|
||
urldate = {2024-02-26},
|
||
abstract = {The notion of programming paradigms, with associated programming languages and methodologies, is a well established tenet of Computer Science pedagogy, enshrined in international curricula. However, this notion sits ill with Kuhn's classic conceptualisation of a scientific paradigm as a dominant world view, which supersedes its predecessors through superior explanatory power. Furthermore, it is not at all clear how programming paradigms are to be characterised and differentiated. Indeed, on closer inspection, apparently disparate programming paradigms are very strongly connected. Rather, they should be viewed as different traditions of a unitary Computer Science paradigm of Turing complete computation complemented by Computational Thinking.},
|
||
archiveprefix = {arXiv},
|
||
keywords = {Computer Science - Programming Languages},
|
||
file = {/Users/oscarplaisant/Zotero/storage/MSBJMKDY/Michaelson - 2020 - Programming Paradigms, Turing Completeness and Com.pdf;/Users/oscarplaisant/Zotero/storage/VJNJU356/2002.html}
|
||
}
|
||
|
||
@article{minskyFormContentComputer1970,
|
||
title = {Form and {{Content}} in {{Computer Science}} (1970 {{ACM}} Turing Lecture)},
|
||
author = {Minsky, Marvin},
|
||
year = 1970,
|
||
month = apr,
|
||
journal = {Journal of the ACM},
|
||
volume = {17},
|
||
number = {2},
|
||
pages = {197--215},
|
||
issn = {0004-5411},
|
||
doi = {10.1145/321574.321575},
|
||
urldate = {2024-03-30},
|
||
file = {/Users/oscarplaisant/Zotero/storage/JSR2BV25/Minsky - 1970 - Form and Content in Computer Science (1970 ACM turing lecture).pdf}
|
||
}
|
||
|
||
@book{okasakiPurelyFunctionalData1999,
|
||
title = {Purely {{Functional Data Structures}}},
|
||
author = {Okasaki, Chris},
|
||
year = 1999,
|
||
month = jun,
|
||
publisher = {Cambridge University Press},
|
||
abstract = {Most books on data structures assume an imperative language such as C or C++. However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme. This book describes data structures from the point of view of functional languages, with examples, and presents design techniques that allow programmers to develop their own functional data structures. The author includes both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for functional languages. All source code is given in Standard ML and Haskell, and most of the programs are easily adaptable to other functional languages. This handy reference for professional programmers working with functional languages can also be used as a tutorial or for self-study.},
|
||
googlebooks = {SxPzSTcTalAC},
|
||
isbn = {978-0-521-66350-2},
|
||
langid = {english},
|
||
keywords = {Computers / Data Science / Data Modeling & Design,Computers / Database Administration & Management,Computers / Languages / General,Computers / Programming / General,Computers / Software Development & Engineering / General},
|
||
file = {/Users/oscarplaisant/Zotero/storage/42P5K7TK/Okasaki - 1999 - Purely Functional Data Structures.pdf}
|
||
}
|
||
|
||
@misc{OpenProblemsCommunication,
|
||
title = {Open Problems in Communication and Computation - {{Anna}}'s {{Archive}}},
|
||
urldate = {2026-03-27},
|
||
howpublished = {https://annas-archive.gd/md5/47f7db963973665771542f4578a8302f},
|
||
file = {/Users/oscarplaisant/Zotero/storage/822E4RYV/47f7db963973665771542f4578a8302f.html}
|
||
}
|
||
|
||
@article{ParadigmeProgrammation2023,
|
||
title = {{Paradigme (programmation)}},
|
||
year = 2023,
|
||
month = jul,
|
||
journal = {Wikip\'edia},
|
||
urldate = {2024-02-24},
|
||
abstract = {Le paradigme de programmation est la fa\c con (parmi d'autres) d'approcher la programmation informatique et de formuler les solutions aux probl\`emes et leur formalisation dans un langage de programmation appropri\'e. Ce n'est pas de la m\'ethodologie contenant une m\'ethode ; cette derni\`ere organise le traitement des probl\`emes reconnus dans l'\'ecosyst\`eme concern\'e pour aboutir \`a la solution conceptuelle et programme ex\'ecutable.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {french},
|
||
annotation = {Page Version ID: 205915300},
|
||
file = {/Users/oscarplaisant/Zotero/storage/J2LXKBSS/Paradigme_(programmation).html}
|
||
}
|
||
|
||
@article{perlisSpecialFeatureEpigrams1982,
|
||
title = {Special {{Feature}}: {{Epigrams}} on Programming},
|
||
shorttitle = {Special {{Feature}}},
|
||
author = {Perlis, Alan J.},
|
||
year = 1982,
|
||
month = sep,
|
||
journal = {ACM SIGPLAN Notices},
|
||
volume = {17},
|
||
number = {9},
|
||
pages = {7--13},
|
||
issn = {0362-1340},
|
||
doi = {10.1145/947955.1083808},
|
||
urldate = {2024-04-02},
|
||
file = {/Users/oscarplaisant/Zotero/storage/DQE9LQFR/Perlis - 1982 - Special Feature Epigrams on programming.pdf}
|
||
}
|
||
|
||
@article{ReactionOscillante2020,
|
||
title = {{R\'eaction oscillante}},
|
||
year = 2020,
|
||
month = dec,
|
||
journal = {Wikip\'edia},
|
||
urldate = {2024-05-17},
|
||
abstract = {Une r\'eaction oscillante est un m\'elange complexe de compos\'es chimiques dont la concentration d'un ou plusieurs composants pr\'esente des changements p\'eriodiques, jusqu'\`a \'epuisement de sa source d'\'energie (g\'en\'eralement, un des r\'eactifs). Dans les cas o\`u l'un des r\'eactifs a une couleur visible, la travers\'ee d'un seuil de concentration peut conduire \`a un brusque changement de couleur. Des exemples de r\'eactions oscillantes sont la r\'eaction de Belooussov-Jabotinski, la r\'eaction de Briggs-Rauscher, la r\'eaction de Bray-Liebhafsky et la r\'eaction oscillante de l'iode, ou, dans un genre un peu diff\'erent, la r\'eaction du c\oe ur battant de mercure. La concentration des produits et des r\'eactifs chimiques d'une r\'eaction oscillante peut \^etre estim\'ee en termes d'amortissement des oscillations.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {french},
|
||
annotation = {Page Version ID: 177361963},
|
||
file = {/Users/oscarplaisant/Zotero/storage/PC6HDH4T/Réaction_oscillante.html}
|
||
}
|
||
|
||
@article{royProgrammingParadigmsDummies,
|
||
title = {Programming {{Paradigms}} for {{Dummies}}: {{What Every Programmer Should Know}}},
|
||
author = {Roy, Peter Van},
|
||
journal = {Universit\'e Catholique de Louvain - UCLouvain},
|
||
langid = {english},
|
||
file = {/Users/oscarplaisant/Zotero/storage/Y32P72P2/Roy - Programming Paradigms for Dummies What Every Prog.pdf}
|
||
}
|
||
|
||
@article{SalaireQualificationPersonnelle2024,
|
||
title = {{Salaire \`a la qualification personnelle}},
|
||
year = 2024,
|
||
month = jan,
|
||
journal = {Wikip\'edia},
|
||
urldate = {2024-05-21},
|
||
abstract = {Le salaire \`a la qualification personnelle ou << salaire \`a vie >> est une forme de r\'emun\'eration dont le principe a principalement \'et\'e th\'eoris\'e par Bernard Friot et l'association d'\'education populaire R\'eseau Salariat. Il permet notamment de dissocier travail et emploi. Avec la cotisation sociale, il serait \`a la base d'un nouveau mode d'organisation socio-\'economique,,.},
|
||
copyright = {Creative Commons Attribution-ShareAlike License},
|
||
langid = {french},
|
||
annotation = {Page Version ID: 212031190},
|
||
file = {/Users/oscarplaisant/Zotero/storage/N5AHGKTQ/Salaire_à_la_qualification_personnelle.html}
|
||
}
|
||
|
||
@book{spinoza-pleiade,
|
||
title = {{\oe uvres compl\`etes}},
|
||
author = {Spinoza},
|
||
year = 2022,
|
||
series = {{Pl\'eiade}},
|
||
publisher = {Gallimard},
|
||
address = {Paris},
|
||
urldate = {2026-04-24},
|
||
langid = {french}
|
||
}
|
||
|
||
@book{strategicservicesSimpleSabotageField,
|
||
title = {Simple Sabotage Field Manual},
|
||
author = {Strategic Services},
|
||
file = {/Users/oscarplaisant/Zotero/storage/QX7B9528/SimpleSabotage.pdf}
|
||
}
|
||
|
||
@misc{StructuredProgrammingWikipedia,
|
||
title = {Structured Programming - {{Wikipedia}}},
|
||
urldate = {2024-04-01},
|
||
howpublished = {https://en.wikipedia.org/wiki/Structured\_programming?oldformat=true},
|
||
file = {/Users/oscarplaisant/Zotero/storage/7XLZX24P/Structured_programming.html}
|
||
}
|
||
|
||
@misc{StructuresDonneesEnregistrements,
|
||
title = {{Structures de donn\'ees/Enregistrements --- Wikilivres}},
|
||
urldate = {2024-03-28},
|
||
howpublished = {https://fr.wikibooks.org/wiki/Structures\_de\_donn\%C3\%A9es/Enregistrements},
|
||
langid = {french},
|
||
file = {/Users/oscarplaisant/Zotero/storage/4LEJY994/Enregistrements.html}
|
||
}
|
||
|
||
@misc{toalProgrammingParadigms,
|
||
title = {Programming {{Paradigms}}},
|
||
author = {Toal, Ray},
|
||
urldate = {2024-03-29},
|
||
howpublished = {https://cs.lmu.edu/\textasciitilde ray/notes/paradigms/},
|
||
file = {/Users/oscarplaisant/Zotero/storage/TB3SLVFZ/paradigms.html}
|
||
}
|
||
|
||
@book{vanroyConceptsTechniquesModels2004,
|
||
title = {Concepts, {{Techniques}}, and {{Models}} of {{Computer Programming}}},
|
||
author = {Van Roy, Peter and Haridi, Seif},
|
||
year = 2004,
|
||
month = jan,
|
||
edition = {1st},
|
||
publisher = {The MIT Press},
|
||
abstract = {This innovative text presents computer programming as a unified discipline in a way that is both practical and scientifically sound. The book focuses on techniques of lasting value and explains them precisely in terms of a simple abstract machine. The book presents all major programming paradigms in a uniform framework that shows their deep relationships and how and where to use them together. After an introduction to programming concepts, the book presents both well-known and lesser-known computation models ("programming paradigms"). Each model has its own set of techniques and each is included on the basis of its usefulness in practice. The general models include declarative programming, declarative concurrency, message-passing concurrency, explicit state, object-oriented programming, shared-state concurrency, and relational programming. Specialized models include graphical user interface programming, distributed programming, and constraint programming. Each model is based on its kernel language -- a simple core language that consists of a small number of programmer-significant elements. The kernel languages are introduced progressively, adding concepts one by one, thus showing the deep relationships between different models. The kernel languages are defined precisely in terms of a simple abstract machine. Because a wide variety of languages and programming paradigms can be modeled by a small set of closely related kernel languages, this approach allows programmer and student to grasp the underlying unity of programming. The book has many program fragments and exercises, all of which can be run on the Mozart Programming System, an Open Source software package that features an interactive incremental development environment.},
|
||
isbn = {978-0-262-22069-9},
|
||
file = {/Users/oscarplaisant/Zotero/storage/AYLD6R6C/Van Roy et Haridi - 2004 - Concepts, Techniques, and Models of Computer Programming.pdf}
|
||
}
|
||
|
||
@misc{vanroyTaxonomiePrincipauxParadigmes,
|
||
title = {Une Taxonomie Des Principaux Paradigmes de Programmation},
|
||
author = {Van Roy, Peter},
|
||
urldate = {2024-04-01},
|
||
howpublished = {https://www.info.ucl.ac.be/\textasciitilde pvr/paradigmes.html},
|
||
file = {/Users/oscarplaisant/Zotero/storage/XQYUPM3F/paradigmes.html}
|
||
}
|
||
|
||
@book{varoufakisConversationsEntreAdultes2017,
|
||
title = {{Conversations entre adultes}},
|
||
author = {Varoufakis, Yanis},
|
||
year = 2017,
|
||
month = sep,
|
||
publisher = {\'Editions Les Liens qui lib\`erent},
|
||
abstract = {Pour la premi\`ere fois, un ancien ministre d\'evoile les coulisses secr\`etes de l'Europe. C'\'etait en janvier 2015\,: \`a peine a-t-il \'et\'e nomm\'e ministre des Finances de la Gr\`ece que Yanis Varoufakis d\'eclenche une des batailles les plus spectaculaires et les plus controvers\'ees de l'histoire r\'ecente en cherchant \`a ren\'egocier les rapports entre son pays et l'Union europ\'eenne. En d\'epit du soutien exceptionnel de la population grecque et de la logique imparable de ses arguments, il s'est heurt\'e \`a un mur et a provoqu\'e l'ire des \'elites politiques, financi\`eres et m\'ediatiques de l'Europe. La v\'erit\'e de cet affrontement \'etait inconnue jusqu'ici -- justement parce que la direction de l'Union europ\'eenne se r\'eunit \`a huis clos. Dans un r\'ecit personnel et explosif, Yanis Varoufakis, \'economiste d'envergure mondiale, explique comment les choses se passent tr\`es concr\`etement dans les couloirs de Bruxelles. Il r\'ev\`ele une histoire \'edifiante o\`u se m\^elent hypocrisie, trahisons, collusions d'int\'er\^ets et acrobaties politiques. Un r\'ecit qui \'ebranlera profond\'ement l'establishment. Aujourd'hui -- comment en douter\,? --, la r\'epression tragique de la r\'ebellion d\'emocratique grecque est \`a l'image des politiques qui m\`enent \`a l'autoritarisme, au populisme et \`a l'instabilit\'e qui menacent le monde occidental. Conversations entre adultes est un vibrant appel \`a renouveler la d\'emocratie europ\'eenne avant qu'il ne soit trop tard. Yanis Varoufakis a \'et\'e ministre des Finances du gouvernement Tsipras et a conduit les n\'egociations sur la dette grecque jusqu'\`a sa d\'emission au lendemain du r\'ef\'erendum du 5 juillet 2015. N\'e \`a Ath\`enes en 1961, il a enseign\'e en Grande-Bretagne, en Australie et aux \'Etats-Unis. Il est aujourd'hui le chef de file du mouvement DiEM25, qui promeut la relance de la d\'emocratie en Europe et s'oppose au diktat de l'aust\'erit\'e.},
|
||
copyright = {Yanis Varoufakis, 2017.},
|
||
langid = {french},
|
||
annotation = {Item ID: \_:n0},
|
||
file = {/Users/oscarplaisant/Zotero/storage/A6VZMLGU/Varoufakis - 2017 - Conversations entre adultes.epub}
|
||
}
|
||
|
||
@incollection{WeirdWonderfulChemistry,
|
||
title = {The {{Weird}} and {{Wonderful Chemistry}} of {{Audioactive Decay}}},
|
||
booktitle = {Open {{Problems}} in {{Communication}} and {{Computation}}},
|
||
author = {Conway, John},
|
||
year = 1987,
|
||
urldate = {2026-03-28},
|
||
langid = {english}
|
||
}
|
||
|
||
@misc{WikiwandTuringcomplet2017,
|
||
title = {Wikiwand - {{Turing-complet}}},
|
||
year = 2017,
|
||
month = feb,
|
||
journal = {Wikiwand},
|
||
urldate = {2024-04-01},
|
||
abstract = {En informatique et en logique, un syst\`eme formel est dit complet au sens de Turing ou Turing-complet s'il poss\`ede un pouvoir expressif au moins \'equivalent \`a celui des machines de Turing. Dans un tel syst\`eme, il est donc possible de programmer n'importe quelle machine de Turing.},
|
||
howpublished = {https://www.wikiwand.com/fr/Turing-complet},
|
||
file = {/Users/oscarplaisant/Zotero/storage/RCAECCMD/Turing-complet.html}
|
||
}
|
||
|
||
@article{willettParadigmeTheorieModele1996,
|
||
title = {{Paradigme, th\'eorie, mod\`ele, sch\'ema : qu'est-ce donc ?}},
|
||
shorttitle = {{Paradigme, th\'eorie, mod\`ele, sch\'ema}},
|
||
author = {Willett, Gilles},
|
||
year = 1996,
|
||
month = nov,
|
||
journal = {Communication et organisation. Revue scientifique francophone en Communication organisationnelle},
|
||
number = {10},
|
||
publisher = {Presses universitaires de Bordeaux},
|
||
issn = {1168-5549},
|
||
doi = {10.4000/communicationorganisation.1873},
|
||
urldate = {2024-04-03},
|
||
abstract = {L'auteur traite des termes paradigme, th\'eorie, mod\`ele et sch\'ema. Il tente de clarifier le plus possible ces termes en traitant de l'essentiel et en mettant l'accent sur ce qui permet de les diff\'erencier. Il rend compte de certaines difficult\'es provoqu\'ees par la polys\'emie de ces termes. Il termine en soulevant certaines questions \`a propos de la communicologie.},
|
||
copyright = {https://creativecommons.org/licenses/by-nc-nd/4.0/},
|
||
langid = {french},
|
||
keywords = {communication,modele,paradigme,schema,theorie},
|
||
file = {/Users/oscarplaisant/Zotero/storage/LFD49R3K/Willett - 1996 - Paradigme, théorie, modèle, schéma qu’est-ce donc .pdf}
|
||
}
|
||
|
||
@book{zotero-item-760,
|
||
type = {Book}
|
||
}
|
||
|
||
@book{zotero-item-761,
|
||
type = {Book}
|
||
}
|
||
|
||
@article{zotero-item-762,
|
||
type = {Article}
|
||
}
|
||
|
||
@book{zotero-item-763,
|
||
type = {Book}
|
||
}
|