Log in

Relevant bibliographies by topics / Functional programming language / Journal articles

To see the other types of publications on this topic, follow the link: Functional programming language.

Journal articles on the topic 'Functional programming language'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Functional programming language.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Ramsdell, J. D. "The Alonzo functional programming language." ACM SIGPLAN Notices 24, no. 9 (1989): 152–57. http://dx.doi.org/10.1145/68127.68139.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Melham, Tom. "CALL FOR PAPERS Journal of Functional Programming Special Issue on Theorem Provers and Functional Programming." Journal of Functional Programming 7, no. 1 (1997): 125–26. http://dx.doi.org/10.1017/s0956796897009350.

Full text

Abstract:

A special issue of the Journal of Functional Programming will be devoted to the use of functional programming in theorem proving. The submission deadline is 31 August 1997.The histories of theorem provers and functional languages have been deeply intertwined since the advent of Lisp. A notable example is the ML family of languages, which are named for the meta language devised for the LCF theorem prover, and which provide both the implementation platform and interaction facilities for numerous later systems (such as Coq, HOL, Isabelle, NuPrl). Other examples include Lisp (as used for ACL2, PVS, Nqthm) and Haskell (as used for Veritas).This special issue is devoted to the theory and practice of using functional languages to implement theorem provers and using theorem provers to reason about functional languages. Topics of interest include, but are not limited to:– architecture of theorem prover implementations– interface design in the functional context– limits of the LCF methodology– impact of host language features– type systems– lazy vs strict languages– imperative (impure) features– performance problems and solutions– problems of scale– special implementation techniques– term representations (e.g. de Bruijn vs name carrying vs BDDs)– limitations of current functional languages– mechanised theories of functional programming

APA, Harvard, Vancouver, ISO, and other styles

3

Maliavko, Aleksandr. "The El functional-imperative programming language." Science Bulletin of the Novosibirsk State Technical University, no. 1 (March 20, 2018): 117–36. http://dx.doi.org/10.17212/1814-1196-2018-1-117-136.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kurz, T., P. Linke, and W. Stäheli. "A Target-Independent Functional Programming Language." IFAC Proceedings Volumes 20, no. 5 (1987): 99–104. http://dx.doi.org/10.1016/s1474-6670(17)55300-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

WAKELING, DAVID. "Spreadsheet functional programming." Journal of Functional Programming 17, no. 1 (2007): 131–43. http://dx.doi.org/10.1017/s0956796806006186.

Full text

Abstract:

AbstractThe functional programming community has shown some interest in spreadsheets, but surprisingly no one seems to have considered making a standard spreadsheet, such as Excel, work with a standard functional programming language, such as Haskell. In this paper, we show one way that this can be done. Our hope is that by doing so, we might get spreadsheet programmers to give functional programming a try.

APA, Harvard, Vancouver, ISO, and other styles

6

DYLUS, SANDRA, JAN CHRISTIANSEN, and FINN TEEGEN. "Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism." Theory and Practice of Logic Programming 20, no. 1 (2019): 147–75. http://dx.doi.org/10.1017/s1471068419000085.

Full text

Abstract:

AbstractThis paper presentsPFLP, a library for probabilistic programming in the functional logic programming language Curry. It demonstrates how the concepts of a functional logic programming language support the implementation of a library for probabilistic programming. In fact, the paradigms of functional logic and probabilistic programming are closely connected. That is, language characteristics from one area exist in the other and vice versa. For example, the concepts of non-deterministic choice and call-time choice as known from functional logic programming are related to and coincide with stochastic memoization and probabilistic choice in probabilistic programming, respectively. We will further see that an implementation based on the concepts of functional logic programming can have benefits with respect to performance compared to a standard list-based implementation and can even compete with full-blown probabilistic programming languages, which we illustrate by several benchmarks.

APA, Harvard, Vancouver, ISO, and other styles

7

Molyneux, Phil. "Functional programming for business students." Journal of Functional Programming 3, no. 1 (1993): 35–48. http://dx.doi.org/10.1017/s0956796800000587.

Full text

Abstract:

AbstractA functional language, Miranda, is being used on an introductory programming course for business students. This paper describes the rationale for such a course and choice of language. An application in the area of operations management, which is used in teaching, is given as an example of the benefits of using a functional language in this area. The reaction of the students and staff to this (for them) new paradigm of programming is described. Some conclusions are drawn for computing education for non-specialists.

APA, Harvard, Vancouver, ISO, and other styles

8

Bradley, Eleanor. "Functional programming languages for AI problem solving." Knowledge Engineering Review 6, no. 3 (1991): 223–35. http://dx.doi.org/10.1017/s0269888900005816.

Full text

Abstract:

AbstractMany problem domains exhibit inherent parallelism, and parallel systems which capture and exploit this can be used to look for efficient solutions to AI problems. Functional programming languages are expected to be efficiently realisable on fifth generation hardware. A rational reconstruction of AI programming paradigms is used to investigate the programmability and performance of functional languages in this particular area.Three languages—Standard ML, Hope+ and Miranda—are used in the rational reconstruction, each language being used to implement three applications. Results indicate that functional programming languages have become much more useable in recent years, and have the potential to become useful tools in AI problem solving. A brief annotated bibliography of texts which covers the introduction to, theory and implementation issues of, functional programming languages, is included.

APA, Harvard, Vancouver, ISO, and other styles

9

Vedana, Arthur Giesel, Rodrigo Machado, and Álvaro Freitas Moreira. "V: a language with extensible record accessors and a trait-based type system." Revista de Informática Teórica e Aplicada 25, no. 3 (2018): 89. http://dx.doi.org/10.22456/2175-2745.82772.

Full text

Abstract:

This article introduces the V language, a purely functional programming language with a novel approach to records.Based on a system of type traits, V attempts to solve issues commonly found when manipulating records in purely functional programming languages.

APA, Harvard, Vancouver, ISO, and other styles

10

Olatunji, Ezekiel Kolawole, John B. Oladosu, Odetunji A. Odejobi, and Stephen O. Olabiyisi. "Design and implementation of an African native language-based programming language." International Journal of Advances in Applied Sciences 10, no. 2 (2021): 171. http://dx.doi.org/10.11591/ijaas.v10.i2.pp171-177.

Full text

Abstract:

<p>Most of the existing high level programming languages havehitherto borrowed their lexical items from human languages including European and Asian languages. However, there is paucity of research information on programming languages developed with the lexicons of an African indigenous language. This research explored the design and implementation of an African indigenous language-based programming language using Yoruba as case study. Yoruba is the first language of over 30 million people in the south-west of Nigeria, Africa; and is spoken by over one hundred million people world-wide. It is hoped, as established by research studies, that making computer programming possible in one’s mother tongue will enhance computer-based problem-solving processes by indigenous learners and teachers. The alphabets and reserved words of the programming language were respectively formed from the basic Yoruba alphabets and standard Yoruba words. The lexical items and syntactic structures of the programming language were designed with appropriate regular expressions and context-free grammars, using Backus-Naur Form (BNF) notations. A prototype implementation of the programming language was carried out as a source-to-source, 5-pass compiler. QBasic within QB64 IDE was the implementation language. The results from implementation showed functional correctness and effectiveness of the developed programming language. Thus lexical items of a programming language need not be borrowed exclusively from European and Asian languages, they can and should be borrowed from most African native languages. Furthermore, the developed native language programming language can be used to introduce computer programming to indigenous pupils of primary and junior secondary schools.</p>

APA, Harvard, Vancouver, ISO, and other styles

11

Runciman, Colin, Amanda Clare, and Rob Harkness. "Laboratory Automation in a Functional Programming Language." Journal of Laboratory Automation 19, no. 6 (2014): 569–76. http://dx.doi.org/10.1177/2211068214543373.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Coome, Jonathan, Michael R. Probert, Andrés E. Goeta, and Judith A. K. Howard. "Crystallographic programming using Haskell, a functional language." Acta Crystallographica Section A Foundations of Crystallography 66, a1 (2010): s313. http://dx.doi.org/10.1107/s0108767310092834.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Jin, Lingzi, and Hong Zhu. "Systems programming in the functional language FP." Journal of Computer Science and Technology 3, no. 1 (1988): 40–55. http://dx.doi.org/10.1007/bf02943331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

LOOGEN, RITA, YOLANDA ORTEGA-MALLÉN, and RICARDO PEÑA-MARÍ. "Parallel functional programming in Eden." Journal of Functional Programming 15, no. 3 (2005): 431–75. http://dx.doi.org/10.1017/s0956796805005526.

Full text

Abstract:

Eden extends the non-strict functional language Haskell with constructs to control parallel evaluation of processes. Although processes are defined explicitly, communication and synchronisation issues are handled in a way transparent to the programmer. In order to offer effective support for parallel evaluation, Eden's coordination constructs override the inherently sequential demand-driven (lazy) evaluation strategy of its computation language Haskell. Eden is a general-purpose parallel functional language suitable for developing sophisticated skeletons – which simplify parallel programming immensely – as well as for exploiting more irregular parallelism that cannot easily be captured by a predefined skeleton. The paper gives a comprehensive description of Eden, its semantics, its skeleton-based programming methodology – which is applied in three case studies – its implementation and performance. Furthermore it points at many additional results that have been achieved in the context of the Eden project.

APA, Harvard, Vancouver, ISO, and other styles

15

PEYTON JONES, SIMON, and PHIL WADLER. "EDITORIAL." Journal of Functional Programming 8, no. 4 (1998): 319–21. http://dx.doi.org/10.1017/s0956796898003049.

Full text

Abstract:

In the end, research on functional languages does little good unless they are used to write something other than compilers for functional languages. However, if one scans a typical functional programming conference or journal, one mainly sees papers on twists in language design, speed-ups in compiled code, clever new analyses, or refinements to semantic models. It much less common to see a paper that considers a functional language as a tool to some other practical end. We would like to see this change.The Journal of Functional Programming carries, and will continue to carry, articles on all aspects of functional programming from lambda calculus theory to language design to implementation. But we have specially sought, and will continue to seek, papers on functional programming practice and experience.Research and papers on practice and experience sometimes receive less attention because they are perceived as possessing less academic content. So we want to remind potential authors that we have published a number of papers on this topic in the past, and to spell out the criteria we apply to such papers.

APA, Harvard, Vancouver, ISO, and other styles

16

OKASAKI, CHRIS. "Special issue on Algorithmic aspects of functional programming languages." Journal of Functional Programming 11, no. 5 (2001): 439–40. http://dx.doi.org/10.1017/s0956796801004142.

Full text

Abstract:

Algorithms can be dramatically affected by the language in which they are implemented. An algorithm that is elegant and efficient in one language may be ugly and inefficient in another. If you have ever attempted to implement an assignment-intensive algorithm in a functional programming language, you are probably more familiar with this phenomenon than you ever wanted to be! But this sword does not cut in only one direction. Functional programming languages are wonderfully suited to expressing certain kinds of algorithms in a clean, modular way, and researchers over the last five to ten years have greatly expanded the range of algorithms for which this is true.

APA, Harvard, Vancouver, ISO, and other styles

17

GAVA, FRÉDÉRIC, and FRÉDÉRIC LOULERGUE. "A FUNCTIONAL LANGUAGE FOR DEPARTMENTAL METACOMPUTING." Parallel Processing Letters 15, no. 03 (2005): 289–304. http://dx.doi.org/10.1142/s0129626405002222.

Full text

Abstract:

We have designed a functional data-parallel language called BSML for programming bulk synchronous parallel (BSP) algorithms. Deadlocks and indeterminism are avoided and the execution time can be then estimated. For very large scale applications more than one parallel machine could be needed. One speaks about metacomputing. A major problem in programming application for such architectures is their hierarchical network structures: latency and bandwidth of the network between parallel nodes could be orders of magnitude worse than those inside a parallel node. Here we consider how to extend both the BSP model and BSML, well-suited for parallel computing, in order to obtain a model and a functional language suitable for metacomputing.

APA, Harvard, Vancouver, ISO, and other styles

18

Kennedy, Andrew J. "Functional Pearls." Journal of Functional Programming 6, no. 3 (1996): 527–34. http://dx.doi.org/10.1017/s0956796800001830.

Full text

Abstract:

AbstractThis article describes the application of functional programming techniques to a problem previously studied by imperative programmers, that of drawing general trees automatically. We first consider the nature of the problem and the ideas behind its solution (due to Radack), independent of programming language implementation. We then describe a Standard ML program which reflects the structure of the abstract solution much better than an imperative language implementation. We conclude with an informal discussion on the correctness of the implementation and some changes which improve the algorithm's worst-case time complexity.

APA, Harvard, Vancouver, ISO, and other styles

19

Edupuganty, B. "Two-level Grammar as a Functional Programming Language." Computer Journal 32, no. 1 (1989): 36–44. http://dx.doi.org/10.1093/comjnl/32.1.36.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Kasyanov, Victor. "Sisal 3.2: functional language for scientific parallel programming." Enterprise Information Systems 7, no. 2 (2013): 227–36. http://dx.doi.org/10.1080/17517575.2012.744854.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Koopman, P. W. M., M. C. J. D. Van Eekelen, and M. J. Plasmeijer. "Operational machine specification in a functional programming language." Software: Practice and Experience 25, no. 5 (1995): 463–99. http://dx.doi.org/10.1002/spe.4380250502.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Hudak, Paul. "Denotational semantics of a para-functional programming language." International Journal of Parallel Programming 15, no. 2 (1986): 103–25. http://dx.doi.org/10.1007/bf01414441.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Malkov, Saša N. "Customizing a functional programming language for web development." Computer Languages, Systems & Structures 36, no. 4 (2010): 345–51. http://dx.doi.org/10.1016/j.cl.2010.04.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Poswig, Jörg, Guido Vrankar, and Claudio Morara. "VisaVis: a Higher-order Functional Visual Programming Language." Journal of Visual Languages & Computing 5, no. 1 (1994): 83–111. http://dx.doi.org/10.1006/jvlc.1994.1005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Aramaki, Shigeto. "The manipulator language with the characteristic of a functional programming language." Journal of Robotic Systems 3, no. 4 (1986): 425–40. http://dx.doi.org/10.1002/rob.4620030407.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Achten, Peter, and Rinus Plasmeijer. "The ins and outs of Clean I/O." Journal of Functional Programming 5, no. 1 (1995): 81–110. http://dx.doi.org/10.1017/s0956796800001258.

Full text

Abstract:

AbstractFunctional programming languages have banned assignment because of its undesirable properties. The reward of this rigorous decision is that functional programming languages are side-effect free. There is another side to the coin: because assignment plays a crucial role in Input/Output (I/O), functional languages have a hard time dealing with I/O. Functional programming languages have therefore often been stigmatised as inferior to imperative programming languages because they cannot deal with I/O very well. In this paper, we show that I/O can be incorporated in a functional programming language without loss of any of the generally accepted advantages of functional programming languages. This discussion is supported by an extensive account of the I/O system offered by the lazy, purely functional programming language Clean. Two aspects that are paramount in its I/O system make the approach novel with respect to other approaches. These aspects are the technique of explicit multiple environment passing, and the Event I/O framework to program Graphical User I/O in a highly structured and high-level way. Clean file I/O is as powerful and flexible as it is in common imperative languages (one can read, write, and seek directly in a file). Clean Event I/O provides programmers with a high-level framework to specify complex Graphical User I/O. It has been used to write applications such as a window-based text editor, an object based drawing program, a relational database, and a spreadsheet program. These graphical interactive programs are completely machine independent, but still obey the look-and-feel of the concrete window environment being used. The specifications are completely functional and make extensive use of uniqueness typing, higher-order functions, and algebraic data types. Efficient implementations are present on the Macintosh, Sun (X Windows under Open Look) and PC (OS/2).

APA, Harvard, Vancouver, ISO, and other styles

27

Silbermann, Frank S. K., and Bharat Jayaraman. "A domain-theoretic approach to functional and logic programming." Journal of Functional Programming 2, no. 3 (1992): 273–321. http://dx.doi.org/10.1017/s095679680000040x.

Full text

Abstract:

AbstractThe integration of functional and logic programming languages has been a topic of great interest in the last decade. Many proposals have been made, yet none is completely satisfactory especially in the context of higher order functions and lazy evaluation. This paper addresses these shortcomings via a new approach: domain theory as a common basis for functional and logic programming. Our integrated language remains essentially within the functional paradigm. The logic programming capability is provided by set abstraction (via Zermelo-Frankel set notation), using the Herbrand universe as a set abstraction generator, but for efficiency reasons our proposed evaluation procedure treats this generator's enumeration parameter as a logical variable. The language is defined in terms of (computable) domain-theoretic constructions and primitives, using the lower (or angelic) powerdomain to model the set abstraction facility. The result is a simple, elegant and purely declarative language that successfully combines the most important features of both pure functional programming and pure Horn logic programming. Referential transparency with respect to the underlying mathematical model is maintained throughout. An implicitly correct operational semantics is obtained by direct execution of the denotational semantic definition, modified suitably to permit logical variables whenever the Herbrand universe is being generated within a set abstraction. Completeness of the operational semantics requires a form of parallel evaluation, rather than the more familiar left-most rule.

APA, Harvard, Vancouver, ISO, and other styles

28

SELINGER, PETER. "Towards a quantum programming language." Mathematical Structures in Computer Science 14, no. 4 (2004): 527–86. http://dx.doi.org/10.1017/s0960129504004256.

Full text

Abstract:

We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. The language is functional in nature, statically typed, free of run-time errors, and has an interesting denotational semantics in terms of complete partial orders of superoperators.

APA, Harvard, Vancouver, ISO, and other styles

29

Ziff, Donald A., Stephen P. Spackman, and Keith Waclena. "Funser: a functional server for textual information retrieval." Journal of Functional Programming 5, no. 3 (1995): 317–43. http://dx.doi.org/10.1017/s0956796800001386.

Full text

Abstract:

AbstractThis paper describes a data-intensive application written in a lazy functional language: a server for textual information retrieval. The design illustrates the importance of interoperability, the capability of interacting with code written in other programming languages. Lazy functional programming is shown to be a powerful and elegant means of accomplishing several desirable concrete goals: delivering initial results promptly, using space economically, and avoiding unnecessary I/O. Performance results, however, are mixed.

APA, Harvard, Vancouver, ISO, and other styles

30

HUTCHISON, NIGEL W. O., UTE NEUHAUS, MANFRED SCHMIDT-SCHAUSS, and CORDY V. HALL. "NATURAL EXPERT: a commercial functional programming environment." Journal of Functional Programming 7, no. 2 (1997): 163–82. http://dx.doi.org/10.1017/s0956796897002657.

Full text

Abstract:

NATURAL EXPERT is a product that allows users to build knowledge-based systems. It uses a lazy functional language, NATURAL EXPERT LANGUAGE, to implement backward chaining and provide a reliable knowledge processing environment in which development can take place. Customers from all over the world buy the system and have used it to handle a variety of problems, including applications such as airplane servicing and bank loan assessment. Some of these are used 10,000 times or more per month.

APA, Harvard, Vancouver, ISO, and other styles

31

Vasilev, Vladimir S., and Alexander I. Legalov. "Loop-invariant Optimization in the Pifagor Language." Modeling and Analysis of Information Systems 25, no. 4 (2018): 347–57. http://dx.doi.org/10.18255/1818-1015-2018-4-347-357.

Full text

Abstract:

The paper considers methods of program transformation equivalent to optimizing the cycle invariant, applied to the functional data-flow model implemented in the Pifagor programming language. Optimization of the cycle invariant in imperative programming languages is reduced to a displacement from the cycle of computations that do not depend on variables that are changes in the loop. A feature of the functional data flow parallel programming language Pifagor is the absence of explicitly specified cyclic computations (the loop operator). However, recurring calculations in this language can be specified recursively or by applying specific language constructs (parallel lists). Both mechanisms provide the possibility of parallel execution. In the case of optimizing a recursive function, repeated calculations are carried out into an auxiliary function, the main function performing only the calculation of the invariant. When optimizing the invariant in computations over parallel lists, the calculation of the invariant moves from the function that executes over the list items to the function containing the call. The paper provides a definition of ”invariant” applied to the Pifagor language, algorithms for its optimization, and examples of program source codes, their graph representations (the program dependence graph) before and after optimization. The algorithm shown for computations over parallel lists is applicable only to the Pifagor language, because it rests upon specific data structures and the computational model of this language. However, the algorithm for transforming recursive functions may be applied to other programming languages.

APA, Harvard, Vancouver, ISO, and other styles

32

Mackie, Ian. "Lilac: a functional programming language based on linear logic." Journal of Functional Programming 4, no. 4 (1994): 395–433. http://dx.doi.org/10.1017/s0956796800001131.

Full text

Abstract:

AbstractWe take Abramsky's term assignment for Intuitionistic Linear Logic (the linear term calculus) as the basis of a functional programming language. This is a language where the programmer must embed explicitly the resource and control information of an algorithm. We give a type reconstruction algorithm for our language in the style of Milner's W algorithm, together with a description of the implementation and examples of use.

APA, Harvard, Vancouver, ISO, and other styles

33

Plant, Robert, and Stephen Murrell. "A natural language help system shell through functional programming." Knowledge-Based Systems 18, no. 1 (2005): 19–35. http://dx.doi.org/10.1016/j.knosys.2004.04.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Kristensen, Lars Michael, and Søren Christensen. "Implementing Coloured Petri Nets Using a Functional Programming Language." Higher-Order and Symbolic Computation (formerly LISP and Symbolic Computation) 17, no. 3 (2004): 207–43. http://dx.doi.org/10.1023/b:lisp.0000029445.29210.ca.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Shaikhha, Amir, Andrew Fitzgibbon, Dimitrios Vytiniotis, and Simon Peyton Jones. "Efficient differentiable programming in a functional array-processing language." Proceedings of the ACM on Programming Languages 3, ICFP (2019): 1–30. http://dx.doi.org/10.1145/3341701.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Frost, Richard A. "Realization of natural language interfaces using lazy functional programming." ACM Computing Surveys 38, no. 4 (2006): 11. http://dx.doi.org/10.1145/1177352.1177353.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Zhu, Hong. "Some mathematical properties of the functional programming language FP." Journal of Computer Science and Technology 2, no. 3 (1987): 202–16. http://dx.doi.org/10.1007/bf02973505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Cheng, Gang, and Zhang Yun-Zheng. "A “Functional + Logic” programming language in interpretation-compilation implementation." Lisp and Symbolic Computation 5, no. 3 (1992): 133–56. http://dx.doi.org/10.1007/bf01807503.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Lazebna, Nataliia. "ENGLISH-LANGUAGE BASIS OF PYTHON PROGRAMMING LANGUAGE." Research Bulletin Series Philological Sciences 1, no. 193 (2021): 371–76. http://dx.doi.org/10.36550/2522-4077-2021-1-193-371-376.

Full text

Abstract:

The dynamic nature of the Python programming language, the accumulation of a certain linguosemiotic basis indicates the similarity of this language with the English language, which is the international one and mediates human communication in both real and virtual worlds. In this study, the English language is positioned as the linguistic basis of Python language of programming, which is widely used in industry, research, natural language processing, textual information retrieval, textual data processing, texts corpora, and more. English language, its lexical features, text representation and interaction with logical and functional basis in the context of Python programming language are considered further in this research. Thus, the unity of verbal units and symbols in the modern English-language digital discourse indicates both the order and variability of the constituents therein. The functionality of linguosemiotic elements produces a network of relationships, where each of these integrated elements can produce from a word or symbol a holistic set of units, which are extrapolated in the English-language digital discourse and mediates human communication with a machine. An overview of the basic properties of Python language, such as values, types, expressions, and operations are in focus of the study. Though users understand the responses of Python interpreter, there is a need to follow certain instructions and codes. To facilitate work with this programming language and prescribed English-language commands, it is necessary to involve linguists to cooperate with programmers to invent a certain logical and reasonable principle of Python commands operation.

APA, Harvard, Vancouver, ISO, and other styles

40

HERRMANN, CHRISTOPH A., and CHRISTIAN LENGAUER. "$\mathcal{HDC}$: A HIGHER-ORDER LANGUAGE FOR DIVIDE-AND-CONQUER." Parallel Processing Letters 10, no. 02n03 (2000): 239–50. http://dx.doi.org/10.1142/s0129626400000238.

Full text

Abstract:

We propose the higher-order functional style for the parallel programming of algorithms. The functional language [Formula: see text], a subset of the language Haskell, facilitates the clean integration of skeletons into a functional program. Skeletons are predefined programming schemata with an efficient parallel implementation. We report on our compiler, which translates [Formula: see text] programs into C+MPI, especially on the design decisions we made. Two small examples, the n queens problem and Karatsuba's polynomial multiplication, are presented to demonstrate the programming comfort and the speedup one can obtain.

APA, Harvard, Vancouver, ISO, and other styles

41

Mason, Ian, and Carolyn Talcott. "Equivalence in functional languages with effects." Journal of Functional Programming 1, no. 3 (1991): 287–327. http://dx.doi.org/10.1017/s0956796800000125.

Full text

Abstract:

AbstractTraditionally the view has been that direct expression of control and store mechanisms and clear mathematical semantics are incompatible requirements. This paper shows that adding objects with memory to the call-by-value lambda calculus results in a language with a rich equational theory, satisfying many of the usual laws. Combined with other recent work, this provides evidence that expressive, mathematically clean programming languages are indeed possible.

APA, Harvard, Vancouver, ISO, and other styles

42

FERNÁNDEZ, ANTONIO J., TERESA HORTALÁ-GONZÁLEZ, FERNANDO SÁENZ-PÉREZ, and RAFAEL DEL VADO-VÍRSEDA. "Constraint functional logic programming over finite domains." Theory and Practice of Logic Programming 7, no. 5 (2007): 537–82. http://dx.doi.org/10.1017/s1471068406002924.

Full text

Abstract:

AbstractIn this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP($\fd$)) with a lazy functional logic programming language which seamlessly embodies finite domain ($\fd$) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP($\fd$)) by combining functional and relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, lazy evaluation, logical variables, types, domain variables, constraint composition, and finite domain constraints. We describe the syntax of the language, its type discipline, and its declarative and operational semantics. We also describe\toy(fd)$, an implementation forCFLP($\fd$), and a comparison of our approach with respect toCLP($\fd$) from a programming point of view, showing the new features we introduce. And, finally, we show a performance analysis which demonstrates that our implementation is competitive with respect to existingCLP($\fd$) systems and that clearly outperforms the closer approach toCFLP($\fd$).

APA, Harvard, Vancouver, ISO, and other styles

43

Grzanek, Konrad. "ChR: Dynamic Functional Constraints Checking in R." Journal of Applied Computer Science Methods 9, no. 1 (2017): 65–78. http://dx.doi.org/10.1515/jacsm-2017-0004.

Full text

Abstract:

Abstract Dynamic typing of R programming language may issue some quality problems in large scale data-science and machine-learning projects for which the language is used. Following our efforts on providing gradual typing library for Clojure we come with a package chR - a library that offers functionality of run-time type-related checks in R. The solution is not only a dynamic type checker, it also helps to systematize thinking about types in the language, at the same time offering high expressivenes and full adherence to functional programming style.

APA, Harvard, Vancouver, ISO, and other styles

44

MARANGET, LUC. "FUNCTIONAL PEARL Functional satisfaction." Journal of Functional Programming 14, no. 6 (2004): 647–56. http://dx.doi.org/10.1017/s0956796804005155.

Full text

Abstract:

This work presents simple decision procedures for the propositional calculus and for a simple predicate calculus. These decision procedures are based upon enumeration of the possible values of the variables in an expression. Yet, by taking advantage of the sequential semantics of boolean connectors, not all values are enumerated. In some cases, dramatic savings of machine time can be achieved. In particular, an equivalence checker for a small programming language appears to be usable in practice.

APA, Harvard, Vancouver, ISO, and other styles

45

Rauber Du Bois, André, Rodrigo Ribeiro, and Maycon Amaro. "A Mechanized Proof of a Textbook Type Unification Algorithm." Revista de Informática Teórica e Aplicada 27, no. 3 (2020): 13–24. http://dx.doi.org/10.22456/2175-2745.100968.

Full text

Abstract:

Unification is the core of type inference algorithms for modern functional programming languages, like Haskell and SML. As a first step towards a formalization of a type inference algorithm for such programming languages, we present a formalization in Coq of a type unification algorithm that follows classic algorithms presented in programming language textbooks. We also report on the use of such formalization to build a correct type inference algorithm for the simply typed λ-calculus.

APA, Harvard, Vancouver, ISO, and other styles

46

Zorzi, Margherita. "Quantum Calculi—From Theory to Language Design." Applied Sciences 9, no. 24 (2019): 5472. http://dx.doi.org/10.3390/app9245472.

Full text

Abstract:

In the last 20 years, several approaches to quantum programming have been introduced. In this survey, we focus on the QRAM (Quantum Random Access Machine) architectural model. We explore the twofold perspective (theoretical and concrete) of the approach and we list the main problems one has to face in quantum language design. Moreover, we propose an overview of some interesting languages and open-source platforms for quantum programming currently available. We also provide the higher-order encoding in the functional languages qPCF and IQu of the well known Deutsch-Jozsa and Simon’s algorithms.

APA, Harvard, Vancouver, ISO, and other styles

47

Winter, Victor. "Bricklayer: An Authentic Introduction to the Functional Programming Language SML." Electronic Proceedings in Theoretical Computer Science 170 (December 12, 2014): 33–49. http://dx.doi.org/10.4204/eptcs.170.3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Priestley, Mark. "AI and the Origins of the Functional Programming Language Style." Minds and Machines 27, no. 3 (2017): 449–72. http://dx.doi.org/10.1007/s11023-017-9432-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Wcislik, M., K. Suchenia, and M. Łaskawski. "Programming of sequential control systems using functional block diagram language." IFAC-PapersOnLine 48, no. 4 (2015): 330–35. http://dx.doi.org/10.1016/j.ifacol.2015.07.056.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Poswolsky, Adam, and Carsten Schürmann. "System Description: Delphin – A Functional Programming Language for Deductive Systems." Electronic Notes in Theoretical Computer Science 228 (January 2009): 113–20. http://dx.doi.org/10.1016/j.entcs.2008.12.120.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!