Search results for 'Functional programming languages' (try it on Scholar)

1000+ found
Sort by:
  1. György E. Révész (1988). Lambda-Calculus, Combinators, and Functional Programming. Cambridge University Press.score: 390.0
    No categories
     
    My bibliography  
     
    Export citation  
  2. Peter H. Schmitt (1995). Logic Programming Languages, Constraints, Functions, and Objects, Edited by Apt KR, Bakker JW de, and Rutten JJMM, Logic Programming, The MIT Press, Cambridge, Mass., and London, 1993, Xiv+ 204 Pp. [REVIEW] Journal of Symbolic Logic 60 (4):1327-1328.score: 238.3
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. Peter H. Schmitt (1995). Review: K. R. Apt, J. W. De Bakker, J. J. M. M. Rutten, Logic Programming Languages, Constraints, Functions, and Objects; Maria Alpuente, Moreno Falaschi, Maurizio Gabbrielli, Giorgio Levi, The Semantics of Equational Logic Programming as an Instance of CLP. [REVIEW] Journal of Symbolic Logic 60 (4):1327-1328.score: 238.3
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. Jan van Eijck, Computational Semantics with Functional Programming.score: 219.0
    Almost forty years ago Richard Montague proposed to analyse natural language with the same tools as formal languages. In particular, he gave formal semantic analyses of several interesting fragments of English in terms of typed logic. This led to the development of Montague grammar as a particular style of formal analysis of natural language.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Jan van Eijck, Computational Semantics, Type Theory, and Functional Programming.score: 211.0
    An emerging standard for polymorphically typed, lazy, purely functional programming is Haskell, a language named after Haskell Curry. Haskell is based on (polymorphically typed) lambda calculus, which makes it an excellent tool for computational semantics.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. Raymond Turner (2014). Programming Languages as Technical Artifacts. Philosophy and Technology 27 (3):377-397.score: 209.3
    Taken at face value, a programming language is defined by a formal grammar. But, clearly, there is more to it. By themselves, the naked strings of the language do not determine when a program is correct relative to some specification. For this, the constructs of the language must be given some semantic content. Moreover, to be employed to generate physical computations, a programming language must have a physical implementation. How are we to conceptualize this complex package? Ontologically, what (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Raymond Turner (2007). Understanding Programming Languages. Minds and Machines 17 (2):203-216.score: 180.0
    We document the influence on programming language semantics of the Platonism/formalism divide in the philosophy of mathematics.
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  8. George J. Tourlakis (2012). Theory of Computation. Wiley.score: 180.0
    In addition, this book contains tools that, in principle, can search a set of algorithms to see whether a problem is solvable, or more specifically, if it can be solved by an algorithm whose computations are efficient.
    Direct download  
     
    My bibliography  
     
    Export citation  
  9. Erkan Tin, Varol Akman & Murat Ersan (1995). Towards Situation-Oriented Programming Languages. Philosophical Explorations.score: 168.0
    Recently, there have been some attempts towards developing programming languages based on situation theory. These languages employ situation-theoretic constructs with varying degrees of divergence from the ontology of the theory. In this paper, we review three of these programming languages.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Jan Jürjens (2002). Games in the Semantics of Programming Languages – an Elementary Introduction. Synthese 133 (1-2):131-158.score: 168.0
    Mathematical models are an important tool in the development ofsoftware technology, including programming languages and algorithms.During the last few years, a new class of such models has beendeveloped based on the notion of a mathematical game that isespecially well-suited to address the interactions between thecomponents of a system. This paper gives an introduction to thesegame-semantical models of programming languages, concentrating onmotivating the basic intuitions and putting them into context.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  11. Vladimir Shalack (2012). On Relational and Functional Languages. Logic and Logical Philosophy 21 (1):25-32.score: 168.0
    We prove two theorems concerning expressive power of relational and functional languages. The theorems have interesting consequences for the history of philosophy and logic.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  12. Michael Gabbay (2011). A Proof-Theoretic Treatment of Λ-Reduction with Cut-Elimination: Λ-Calculus as a Logic Programming Language. Journal of Symbolic Logic 76 (2):673 - 699.score: 152.7
    We build on an existing a term-sequent logic for the λ-calculus. We formulate a general sequent system that fully integrates αβη-reductions between untyped λ-terms into first order logic. We prove a cut-elimination result and then offer an application of cut-elimination by giving a notion of uniform proof for λ-terms. We suggest how this allows us to view the calculus of untyped αβ-reductions as a logic programming language (as well as a functional programming language, as it is traditionally (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  13. Frederick R. Adams, Kenneth Aizawa & Gary Fuller (1992). Rules in Programming Languages and Networks. In J. Dinsmore (ed.), The Symbolic and Connectionist Paradigms: Closing the Gap. Lawrence Erlbaum.score: 140.0
  14. Jan van Eijck, Modelling the Epistemics of Communication with Functional Programming.score: 140.0
    Dynamic epistemic logic is the logic of the effects of epistemic actions like making public announcements, passing private messages, revealing secrets, telling lies. This paper takes its starting point from the version of dynamic epistemic logic of [2], and demonstrates a tool that can be used for showing what goes on during a series of epistemic updates: the dynamic epistemic modelling tool DEMO [7, 9]. DEMO allows modelling epistemic updates, graphical display of update results, graphical display of action models, formula (...)
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  15. Jan van Eijck, Modelling Epistemic Updates with Functional Programming.score: 140.0
    Epistemic logic is the logic of knowledge, and dynamic epistemic logic is the logic of effects of communicative actions on the knowledge states of a set of agents. Typical communicative actions are making public announcements, passing private messages, revealing secrets, telling lies. This paper takes its starting point from the version of dynamic epistemic logic of [3], and demonstrates a tool that can be used for showing what goes on during a series of epistemic updates: the dynamic epistemic modelling tool (...)
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  16. Karl Meinke (1994). Review: Gerard Huet, Logical Foundations of Functional Programming. [REVIEW] Journal of Symbolic Logic 59 (4):1439-1441.score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  17. Arnon Avron (1999). Review: John C. Mitchell, Foundations for Programming Languages. [REVIEW] Journal of Symbolic Logic 64 (2):918-922.score: 140.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  18. Frank Pfenning (2004). Types and Programming Languages. Bulletin of Symbolic Logic 10 (2):213-214.score: 140.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  19. John H. Connolly (2001). Context in the Study of Human Languages and Computer Programming Languages: A Comparison. In P. Bouquet V. Akman (ed.), Modeling and Using Context. Springer. 116--128.score: 140.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  20. J. H. Connolly & D. J. Cooke (2004). The Pragmatics of Programming Languages. Semiotica 2004 (151).score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  21. Adam Drozdek (1993). Semantics of Programming Languages and the Theory of Truth. Epistemologia 16:281-310.score: 140.0
     
    My bibliography  
     
    Export citation  
  22. David Park (1975). Review: E. K. Blum, Towards a Theory of Semantics and Compilers for Programming Languages. [REVIEW] Journal of Symbolic Logic 40 (3):470-471.score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Anderson Faustino da Silva & Vitor Santos Costa (2006). Doctoral Consortium Presentations-The Design and Implementation of the YAP Compiler: An Optimizing Compiler for Logic Programming Languages. In O. Stock & M. Schaerf (eds.), Lecture Notes in Computer Science. Springer-Verlag. 461-462.score: 140.0
    No categories
     
    My bibliography  
     
    Export citation  
  24. Andrzej Skowron (1971). Semantic Translation of Programming Languages. Mathematical Logic Quarterly 17 (1):39-46.score: 140.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  25. G. Graham White (2004). The Philosophy of Programming Languages. In L. Floridi (ed.), The Blackwell Guide to the Philosophy of Computing and Information. Blackwell. 237--247.score: 140.0
    No categories
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  26. Jan van Eijck, Haskell Programming With Tests, and Some Alloy.score: 133.0
    How to write a program in Haskell, and how to use the Haskell testing tools . . . QuickCheck is a tool written in the functional programming language Haskell that allows testing of specifications by means of randomly generated tests. QuickCheck is part of the standard Haskell library. Re-implementations of QuickCheck exist for many languages, including Ruby and Scheme. SmallCheck is a similar tool, different from QuickCheck in that it tests properties for all finitely many values of (...)
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  27. H. H. Pattee (2008). Physical and Functional Conditions for Symbols, Codes, and Languages. Biosemiotics 1 (2):147-168.score: 132.0
    All sciences have epistemic assumptions, a language for expressing their theories or models, and symbols that reference observables that can be measured. In most sciences the language in which their models are expressed are not the focus of their attention, although the choice of language is often crucial for the model. On the contrary, biosemiotics, by definition, cannot escape focusing on the symbol–matter relationship. Symbol systems first controlled material construction at the origin of life. At this molecular level it is (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  28. Kumiko Tanaka-Ishii (2006). Dyadic Versus Triadic Sign Models in Functional and Object-Oriented Computer Programming Paradigms. Semiotica 2006 (158):213-231.score: 120.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  29. Sidnéa Nunes Ferreira (2007). Bridging Theories: A Logical-Functional Perspective on Languages. Semiotica 2007 (167):91-118.score: 120.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  30. Karel Lambert (2001). From Predication to Programming. Minds and Machines 11 (2):257-265.score: 114.7
    A free logic is one in which a singular term can fail to refer to an existent object, for example, `Vulcan' or `5/0'. This essay demonstrates the fruitfulness of a version of this non-classical logic of terms (negative free logic) by showing (1) how it can be used not only to repair a looming inconsistency in Quine's theory of predication, the most influential semantical theory in contemporary philosophical logic, but also (2) how Beeson, Farmer and Feferman, among others, use it (...)
    Direct download (11 more)  
     
    My bibliography  
     
    Export citation  
  31. Bruno Buchberger (1972). A Study on Universal Functions. Institut für Numerische Mathematik Und Elektronische Informationsverarbeitung, Universität Innsbruck.score: 112.3
    No categories
     
    My bibliography  
     
    Export citation  
  32. Jean-Pierre Desclés, Anca Christine Pascu & Hee-Jin Ro (2014). Aspecto-Temporal Meanings Analysed by Combinatory Logic. Journal of Logic, Language and Information 23 (3):253-274.score: 109.0
    What is the meaning of language expressions and how to compute or calculate it? In this paper, we give an answer to this question by analysing the meanings of aspects and tenses in natural languages inside the formal model of an grammar of applicative, cognitive and enunciative operations (GRACE) (Desclés and Ro in Math Sci Hum 194:39–70, 2011), using the applicative formalism, functional types of categorial grammars and combinatory logic (CL) (Curry and Feys in Combinatory Logic. North-Holland Publishing, (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  33. C. J. Topping, M. J. Rehder & B. H. Mayoh (1999). Viola: A New Visual Programming Language Designed for the Rapid Development of Interacting Agent Systems. Acta Biotheoretica 47 (2).score: 94.7
    The construction of complex simulation models and the application of new computer hardware to ecological problems has resulted in the need for many ecologists to rely on computer programmers to develop their modelling software. However, this can lead to a lack of flexibility and understanding in model implementation and in resource problems for researchers. This paper presents a new programming language, Viola, based on a simple organisational concept which can be used by most researchers to develop complex simulations much (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  34. Henk Barendregt (1997). The Impact of the Lambda Calculus in Logic and Computer Science. Bulletin of Symbolic Logic 3 (2):181-215.score: 90.0
    One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  35. Giuseppe Primiero (2014). A Taxonomy of Errors for Information Systems. Minds and Machines 24 (3):249-273.score: 90.0
    We provide a full characterization of computational error states for information systems. The class of errors considered is general enough to include human rational processes, logical reasoning, scientific progress and data processing in some functional programming languages. The aim is to reach a full taxonomy of error states by analysing the recovery and processing of data. We conclude by presenting machine-readable checking and resolve algorithms.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  36. Jean-Louis Krivine (2001). Typed Lambda-Calculus in Classical Zermelo-Frænkel Set Theory. Archive for Mathematical Logic 40 (3):189-205.score: 90.0
    , which uses the intuitionistic propositional calculus, with the only connective →. It is very important, because the well known Curry-Howard correspondence between proofs and programs was originally discovered with it, and because it enjoys the normalization property: every typed term is strongly normalizable. It was extended to second order intuitionistic logic, in 1970, by J.-Y. Girard [4], under the name of system F, still with the normalization property.More recently, in 1990, the Curry-Howard correspondence was extended to classical logic, following (...)
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  37. Ralph Gregory Taylor (1998). Models of Computation and Formal Languages. Oxford University Press.score: 89.0
    This unique book presents a comprehensive and rigorous treatment of the theory of computability which is introductory yet self-contained. It takes a novel approach by looking at the subject using computation models rather than a limitation orientation, and is the first book of its kind to include software. Accompanying software simulations of almost all computational models are available for use in conjunction with the text, and numerous examples are provided on disk in a user-friendly format. Its applications to computer science (...)
     
    My bibliography  
     
    Export citation  
  38. Jan van Eijck, NLP, Philosophy, and Logic.score: 88.0
    In this tutorial, the meaning of natural language is analysed along the lines proposed by Gottlob Frege and Richard Montague. In building meaning representations, we assume that the meaning of a complex expression derives from the meanings of its components. Typed logic is a convenient tool to make this process of composition explicit. Typed logic allows for the building of semantic representations for formal languages and fragments of natural language in a compositional way. The tutorial ends with the discussion (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  39. Lawrence W. Barsalou (1999). Perceptual Symbol Systems. Behavioral and Brain Sciences 22 (4):577-660.score: 87.0
    Prior to the twentieth century, theories of knowledge were inherently perceptual. Since then, developments in logic, statis- tics, and programming languages have inspired amodal theories that rest on principles fundamentally different from those underlying perception. In addition, perceptual approaches have become widely viewed as untenable because they are assumed to implement record- ing systems, not conceptual systems. A perceptual theory of knowledge is developed here in the context of current cognitive science and neuroscience. During perceptual experience, association areas (...)
    Direct download (17 more)  
     
    My bibliography  
     
    Export citation  
  40. Yorick Wilks (1982). Reviews. [REVIEW] British Journal for the Philosophy of Science 33 (3):191-195.score: 87.0
    When John von Neumann turned his interest to computers, he was one of the leading mathematicians of his time. In the 1940s, he helped design two of the first stored-program digital electronic computers. He authored reports explaining the functional organization of modern computers for the first time, thereby influencing their construction worldwide (von Neumann, 1945; Burks et al., 1946). In the first of these reports, von Neumann described the computer as analogous to a brain, with an input “organ” (analogous (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  41. Timothy R. Colburn (1998). Information Modeling Aspects of Software Development. Minds and Machines 8 (3):375-393.score: 84.0
    The distinction between the modeling of information and the modeling of data in the creation of automated systems has historically been important because the development tools available to programmers have been wedded to machine oriented data types and processes. However, advances in software engineering, particularly the move toward data abstraction in software design, allow activities reasonably described as information modeling to be performed in the software creation process. An examination of the evolution of programming languages and development of (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  42. Roberto M. Amadio (1998). Domains and Lambda-Calculi. Cambridge University Press.score: 84.0
    This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory (...)
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  43. Christen Krogh & Henning Herrestad (1999). Hohfeld in Cyberspace and Other Applications of Normative Reasoning in Agent Technology. Artificial Intelligence and Law 7 (1):81-96.score: 84.0
    Two areas of importance for agents and multiagent systems are investigated: design of agent programming languages, and design of agent communication languages. The paper contributes in the above mentioned areas by demonstrating improved or novel applications for deontic logic and normative reasoning. Examples are taken from computer-supported cooperative work, and electronic commerce.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  44. Graham White (2013). Notions of Information: Remarks on Fresco's Paper. Philosophy and Technology 26 (1):61-65.score: 84.0
    We compare Fresco’s analysis of the Turing machine-based notion of computation with that of others, in particular with functional programming and with the reversible computing paradigm of Toffoli and others. We conclude that, although much useful philosophical work can be done by the sort of analysis that Fresco proposes, there is, nevertheless, always likely to be a number of individually viable but different accounts of computation.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  45. John McCarthy, Some Lisp History and Some Programming Language Ideas.score: 82.0
    • Lisp was intended to be compiled at first. However, a universal Lisp function eval in 1959 to show that neater language for computability theory than Turing Steve Russell pointed out that the universal function taken as an interpreter for pure Lisp, and hand-compiled..
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  46. David B. Resnik (1995). Functional Language and Biological Discovery. Journal for General Philosophy of Science 26 (1):119 - 134.score: 80.0
    This paper provides an explication and defense of a view that many philosophers and biologists have accepted though few have understood, the idea that functional language can play an important role in biological discovery. I defend four theses in support of this view: (1) functional statements can serve as background assumptions that produce research problems; (2) functional questions can be important parts of research problems; (3) functional concepts can provide a framework for developing general theories; (4) (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  47. Rasha Abdel Rahman Arne Ewald, Sabrina Aristei, Guido Nolte (2012). Brain Oscillations and Functional Connectivity During Overt Language Production. Frontiers in Psychology 3.score: 80.0
    In the present study we investigate the communication of different large scale brain sites during an overt language production task with state of the art methods for the estimation of EEG functional connectivity. Participants performed a semantic blocking task in which objects were named in semantically homogeneous blocks of trials consisting of members of a semantic category (e.g., all objects are tools) or in heterogeneous blocks, consisting of unrelated objects. The classic pattern of slower naming times in the homogeneous (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  48. Metten Somers, Sebastiaan F. W. Neggers, Kelly M. Diederen, Marco P. Boks, Rene S. Kahn & Iris E. Sommer (2011). The Measurement of Language Lateralization with Functional Transcranial Doppler and Functional MRI: A Critical Evaluation. Frontiers in Human Neuroscience 5.score: 80.0
    Cerebral language lateralization can be assessed in several ways. In healthy subjects, functional MRI (fMRI) during performance of a language task has evolved to be the most frequently applied method. Functional Transcranial Doppler (fTCD) may provide a valid alternative, but has been used rarely. Both techniques have their own strengths and weaknesses and as a result may be applied in different fields of research. Until now, only one relatively small study (n=13) investigated the correlation between lateralization indices measured (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  49. Arne Ewald, Sabrina Aristei, Guido Nolte & Rasha Abdel Rahman (2012). Brain Oscillations and Functional Connectivity During Overt Language Production. Frontiers in Psychology 3.score: 80.0
    In the present study we investigate the communication of different large scale brain sites during an overt language production task with state of the art methods for the estimation of EEG functional connectivity. Participants performed a semantic blocking task in which objects were named in semantically homogeneous blocks of trials consisting of members of a semantic category (e.g., all objects are tools) or in heterogeneous blocks, consisting of unrelated objects. The classic pattern of slower naming times in the homogeneous (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000