Functional Programming in Computer Science
| Autor: | Loren James Anderson, Marion Kei Davis |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Functional logic programming
Computer science Programming language Higher-order programming computer.software_genre Extensible programming Functional compiler TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Compiler construction TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Programming paradigm computer Declarative programming Programming language theory |
| DOI: | 10.2172/1237221 |
| Popis: | We explore functional programming through a 16-week internship at Los Alamos National Laboratory. Functional programming is a branch of computer science that has exploded in popularity over the past decade due to its high-level syntax, ease of parallelization, and abundant applications. First, we summarize functional programming by listing the advantages of functional programming languages over the usual imperative languages, and we introduce the concept of parsing. Second, we discuss the importance of lambda calculus in the theory of functional programming. Lambda calculus was invented by Alonzo Church in the 1930s to formalize the concept of effective computability, and every functional language is essentially some implementation of lambda calculus. Finally, we display the lasting products of the internship: additions to a compiler and runtime system for the pure functional language STG, including both a set of tests that indicate the validity of updates to the compiler and a compiler pass that checks for illegal instances of duplicate names. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|