-
1
المؤلفون: Bouverot-Dupuis, Mathis, Sheeran, Mary, 1959
المصدر: En algebra av tensorkombinerare och dess tillämpningar 11th ACM SIGPLAN International Workshop on Functional High-Performance and Numerical Computing, FHPNC 2023, co-located with ICFP, Seattle, USA FHPNC 2023 - Proceedings of the 11th ACM SIGPLAN International Workshop on Functional High-Performance and Numerical Computing, Co-located with ICFP 2023. :15-28
مصطلحات موضوعية: functional languages, GPU, data-parallelism
وصف الملف: electronic
الوصول الحر: https://research.chalmers.se/publication/537973Test
https://research.chalmers.se/publication/537973/file/537973_Fulltext.pdfTest -
2دورية أكاديمية
المؤلفون: Solomon, Cynthia, Harvey, Brian, Kahn, Ken, Lieberman, Henry, Miller, Mark L, Minsky, Margaret, Papert, Artemis, Silverman, Brian
المصدر: Proceedings of the ACM on Programming Languages. 4(HOPL)
مصطلحات موضوعية: Quality Education, Logo, Lisp, Constructionism, Constructivism, turtle geometry, Education-Interactive learning environments, History of computingsHistory of programming languages, Computing educations- Computational thinking, Computing education programsDComputer science education, Informal education, Computing literacy, K-12 education, Software notations and tools- General programming languages, Imperative languages, Functional languages, Language featuressControl structures, Data types and structures, Recursion, Procedures, functions and subroutines, Theory of computations-Models of computation-computabilitys-, Lambda calculus, Recursive functions, Interactive computation., Logo, Lisp, Constructionism, Constructivism, turtle geometry, Education– Interactive learning environments, History of computing–History of programming languages, Computing education– Computational thinking, Computing education programs—Computer science education, Informal education, Computing literacy, K-12 education (ages 5-18), Software notations and tools–General programming languages, Imperative languages, Functional languages, Language features–Control structures, Data types and structures, Recursion, Procedures, functions and subroutines, Theory of computation–Models of computation— Computability–Lambda calculus, Recursive functions, Interactive computation.
وصف الملف: application/pdf
الوصول الحر: https://escholarship.org/uc/item/1623m1p3Test
-
3مؤتمر
المؤلفون: Montagu, Benoît
المساهمون: Analyse sémantique et compilation pour la sécurité des environnements d'exécution (EPICURE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)
المصدر: ML Family 2023 - Higher-order, Typed, Inferred, Strict: ACM SIGPLAN ML Family Workshop ; https://inria.hal.science/hal-04259875Test ; ML Family 2023 - Higher-order, Typed, Inferred, Strict: ACM SIGPLAN ML Family Workshop, Sep 2023, Seattle, Washington, United States. pp.1-4
مصطلحات موضوعية: Abstract interpretation, Static analysis, Functional languages, Exception analysis, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]
جغرافية الموضوع: Seattle, Washington, United States
العلاقة: hal-04259875; https://inria.hal.science/hal-04259875Test; https://inria.hal.science/hal-04259875/documentTest; https://inria.hal.science/hal-04259875/file/ML2023_Salto_preliminary_report.pdfTest
-
4مؤتمر
المؤلفون: Larchey-Wendling, Dominique, Monin, Jean-François
المساهمون: Logic, Proof Theory and Programming (TYPES), Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), VERIMAG (VERIMAG - IMAG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Adam Naumowicz, René Thiemann, LIPICS, ANR-21-CE48-0011,NARCO,Compositions Non-agrégatives de Resources(2021)
المصدر: 14th International Conference on Interactive Theorem Proving (ITP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 268, pp. 1-660, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)https://doi.org/10.4230/LIPIcs.ITP.2023Test
14th International Conference on Interactive Theorem Proving (ITP 2023)
https://hal.science/hal-04200527Test
14th International Conference on Interactive Theorem Proving (ITP 2023), Adam Naumowicz
René Thiemann, Jul 2023, Białystok, Poland. pp.21:1--17, ⟨10.4230/LIPIcs.ITP.2023.21⟩
https://mizar.uwb.edu.pl/ITP2023/program.htmlTestمصطلحات موضوعية: Theory of computation → Models of computation, µ-recursive functions, computational contents, Coq, extraction, OCaml, Theory of computation → Functional constructs, Software and its engineering → Formal methods, Software and its engineering → Functional languages, Theory of computation → Higher order logic phrases Unbounded linear search, Theory of computation → Type theory, [INFO]Computer Science [cs]
الوقت: Białystok, Poland
العلاقة: hal-04200527; https://hal.science/hal-04200527Test; https://hal.science/hal-04200527/documentTest; https://hal.science/hal-04200527/file/itp23-murec.pdfTest
الإتاحة: https://doi.org/10.4230/LIPIcs.ITP.2023.21Test
https://doi.org/10.4230/LIPIcs.ITP.2023Test
https://hal.science/hal-04200527Test
https://hal.science/hal-04200527/documentTest
https://hal.science/hal-04200527/file/itp23-murec.pdfTest -
5مؤتمر
المؤلفون: Accattoli, Beniamino
المساهمون: Automatisation et ReprésenTation: fOndation du calcUl et de la déducTion (PARTOUT), Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)
المصدر: Onward! 2023 - ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software ; https://hal.science/hal-04280550Test ; Onward! 2023 - ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, Oct 2023, Cascais, Portugal. pp.179-190, ⟨10.1145/3622758.3622884⟩
مصطلحات موضوعية: Lambda calculus, functional languages, sharing, [INFO]Computer Science [cs]
العلاقة: hal-04280550; https://hal.science/hal-04280550Test; https://hal.science/hal-04280550/documentTest; https://hal.science/hal-04280550/file/3622758.3622884.pdfTest
الإتاحة: https://doi.org/10.1145/3622758.3622884Test
https://hal.science/hal-04280550Test
https://hal.science/hal-04280550/documentTest
https://hal.science/hal-04280550/file/3622758.3622884.pdfTest -
6دورية أكاديمية
المؤلفون: Aguirre, Alejandro, Birkedal, Lars
المصدر: Aguirre , A & Birkedal , L 2023 , ' Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice ' , Proceedings of the ACM on Programming Languages , vol. 7 , 2 , pp. 33-60 . https://doi.org/10.1145/3571195Test
مصطلحات موضوعية: Functional Languages, Logical Relations, Probabilistic programming
الإتاحة: https://doi.org/10.1145/3571195Test
https://pure.au.dk/portal/en/publications/ec8e5f59-0d1a-4feb-a6c6-b44352300da7Test
http://www.scopus.com/inward/record.url?scp=85146425470&partnerID=8YFLogxKTest -
7دورية أكاديمية
المؤلفون: Ekici, Burak
المساهمون: MÜ, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü, orcid:0000-0002-6602-7906, Ekici, Burak
مصطلحات موضوعية: Definitional interpreters, Simply typed functional languages, Formal soundness proofs, The Coq proof assistant
وصف الملف: application/pdf
العلاقة: Axioms; Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı; Ekici, B. A Sound Definitional Interpreter for a Simply Typed Functional Language. Axioms 2023, 12, 43. https://doi.orgTest/ 10.3390/axioms12010043; https://doi.orgTest/ 10.3390/axioms12010043; https://hdl.handle.net/20.500.12809/10515Test; 12
-
8تقرير
المؤلفون: Forster, Yannick, Sozeau, Matthieu, Tabareau, Nicolas
المساهمون: Langages de programmation : systèmes de types, concurrence, preuve de programme (CAMBIUM), Collège de France (CdF (institution))-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Gallinette : vers une nouvelle génération d'assistant à la preuve (GALLINETTE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-NANTES UNIVERSITÉ - École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ)
المصدر: https://inria.hal.science/hal-04329663Test ; 2023.
مصطلحات موضوعية: Verified compilation, Extraction, Functional languages, Coq, [INFO]Computer Science [cs]
العلاقة: hal-04329663; https://inria.hal.science/hal-04329663Test; https://inria.hal.science/hal-04329663/documentTest; https://inria.hal.science/hal-04329663/file/main.pdfTest
-
9دورية أكاديمية
المؤلفون: Szokoli Mátyás, Kiss Attila
المصدر: Acta Universitatis Sapientiae: Informatica, Vol 12, Iss 2, Pp 232-250 (2020)
مصطلحات موضوعية: type inference, dynamic typing, binding-time analysis, partial evaluation, functional languages, 68n18, 68n15, 03b38, Electronic computers. Computer science, QA75.5-76.95
وصف الملف: electronic resource
العلاقة: https://doaj.org/toc/2066-7760Test
-
10دورية أكاديمية
المؤلفون: Burak Ekici
المصدر: Axioms, Vol 12, Iss 1, p 43 (2022)
مصطلحات موضوعية: definitional interpreters, simply typed functional languages, formal soundness proofs, the Coq proof assistant, Mathematics, QA1-939
وصف الملف: electronic resource