F#

F# (pronounced F sharp) is a strongly typed, multi-paradigm programming language that encompasses functional, imperative, and object-oriented programming methods.

References in zbMATH (referenced in 15 articles )

Showing results 1 to 15 of 15.

Sorted by year (citations)

Azimov, R.; Grigorev, S.: Path querying with conjunctive grammars by matrix multiplication (2019)
Nielson, Flemming; Riis Nielson, Hanne: Formal methods. An appetizer (2019)
Srajer, Filip; Kukelova, Zuzana; Fitzgibbon, Andrew: A benchmark of selected algorithmic differentiation tools on some problems in computer vision and machine learning (2018)
Giannini, Paola; Shaqiri, Albert: A provably correct compilation of functional languages into scripting languages (2017)
Sestoft, Peter: Programming language concepts. With a chapter by Niels Hallenberg (2017)
Eisenberg, Richard A.; Weirich, Stephanie; Ahmed, Hamidhasan G.: Visible type application (2016)
Robert S. Smith, Michael J. Curtis, William J. Zeng: A Practical Quantum Instruction Set Architecture (2016) arXiv
Phan, Anh-Dung; Hansen, Michael R.: An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic (2015)
Cheney, James; Lindley, Sam; Wadler, Philip: A practical theory of language-integrated query (2013)
Goncharov, Sergey; Schröder, Lutz: A coinductive calculus for asynchronous side-effecting processes (2013)
Galkin, O. V.: Formalization of the functional programming languages based on lambda calculus (2012)
Borgström, Johannes; Gordon, Andrew D.; Greenberg, Michael; Margetson, James; Van Gael, Jurgen: Measure transformer semantics for Bayesian machine learning (2011)
Goncharov, Sergey; Schröder, Lutz: A coinductive calculus for asynchronous side-effecting processes (2011)
Henglein, Fritz; Larsen, Ken Friis; Simonsen, Jakob Grue; Stefansen, Christian: POETS: process-oriented event-driven transaction systems (2009)
Syme, Don; Neverov, Gregory; Margetson, James: Extensible pattern matching via a lightweight language extension (2007)