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

1000+ found
Order:
  1. György E. Révész (1988). Lambda-Calculus, Combinators, and Functional Programming. Cambridge University Press.
  2. Krzysztof R. Apt & Association for Logic Programming (1992). Logic Programming Proceedings of the Joint International Conference and Symposium on Logic Programming. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography  
  3. K. L. Clark, S. Tärnlund & International Workshop on Logic Programming (1982). Logic Programming.
    No categories
     
    Export citation  
     
    My bibliography  
  4. J. Dix, Luís Moniz Pereira, Teodor C. Przymusinski & International Conference on Logic Programming (1995). Non-Monotonic Extensions of Logic Programming Iclp '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994 : Selected Papers. [REVIEW]
    No categories
     
    Export citation  
     
    My bibliography  
  5. Robert Kowalski, Kenneth A. Bowen, Association for Logic Programming, Ieee Computer Society & Symposium on Logic Programming (1988). Logic Programming Proceedings of the Fifth International Conference and Symposium. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography  
  6. Wiktor Marek, Anil Nerode, V. S. Subrahmanian & Association for Logic Programming (1991). Logic Programming and Non-Monotonic Reasoning Proceedings of the First International Workshop. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography  
  7. Dale Miller & Association for Logic Programming (1993). Logic Programming Proceedings of the 1993 International Symposium. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography  
  8. Peter Szeredi, David H. D. Warren & International Conference on Logic Programming (1990). Logic Programming Proceedings of the Seventh International Conference. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography  
  9. Evan Tick, Giancarlo Succi & International Conference on Logic Programming (1994). Implementations of Logic Programming Systems.
    No categories
     
    Export citation  
     
    My bibliography  
  10.  50
    Jan van Eijck, Computational Semantics with Functional Programming.
    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
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  11.  20
    Raymond Turner (2014). Programming Languages as Technical Artifacts. Philosophy and Technology 27 (3):377-397.
    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)  
     
    Export citation  
     
    My bibliography   2 citations  
  12. Krzysztof R. Apt, J. W. de Bakker & J. J. M. M. Rutten (1993). Logic Programming Languages Constraints, Functions, and Objects. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography  
  13. C. A. R. Hoare & J. C. Shepherdson (1985). Mathematical Logic and Programming Languages.
    No categories
     
    Export citation  
     
    My bibliography  
  14.  4
    George J. Tourlakis (2012). Theory of Computation. Wiley.
    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  
     
    Export citation  
     
    My bibliography  
  15.  40
    Jan van Eijck, Computational Semantics, Type Theory, and Functional Programming.
    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
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16.  19
    Jan Jürjens (2002). Games in the Semantics of Programming Languages – an Elementary Introduction. Synthese 133 (1-2):131-158.
    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)  
     
    Export citation  
     
    My bibliography  
  17.  9
    Erkan Tin, Varol Akman & Murat Ersan (1995). Towards Situation-Oriented Programming Languages. Philosophical Explorations.
    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)  
     
    Export citation  
     
    My bibliography  
  18.  31
    Raymond Turner (2007). Understanding Programming Languages. Minds and Machines 17 (2):203-216.
    We document the influence on programming language semantics of the Platonism/formalism divide in the philosophy of mathematics.
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  19.  2
    Vladimir Shalack (2012). On Relational and Functional Languages. Logic and Logical Philosophy 21 (1):25-32.
    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 (6 more)  
     
    Export citation  
     
    My bibliography  
  20.  1
    J. H. Connolly & D. J. Cooke (2004). The Pragmatics of Programming Languages. Semiotica 2004 (151).
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  21. 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.
    No categories
    Translate
     
     
    Export citation  
     
    My bibliography   3 citations  
  22.  4
    Andrzej Skowron (1971). Semantic Translation of Programming Languages. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 17 (1):39-46.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  23.  1
    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.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  24.  36
    Jan van Eijck, Modelling the Epistemics of Communication with Functional Programming.
    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 (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  25.  11
    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
  26.  15
    Jan van Eijck, Modelling Epistemic Updates with Functional Programming.
    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 (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  27.  3
    Karl Meinke (1994). Review: Gerard Huet, Logical Foundations of Functional Programming. [REVIEW] Journal of Symbolic Logic 59 (4):1439-1441.
    Direct download  
     
    Export citation  
     
    My bibliography  
  28.  1
    Frank Pfenning (2004). Types and Programming Languages. Bulletin of Symbolic Logic 10 (2):213-214.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  29.  1
    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.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  30.  1
    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.
    Direct download  
     
    Export citation  
     
    My bibliography  
  31.  1
    Arnon Avron (1999). Review: John C. Mitchell, Foundations for Programming Languages. [REVIEW] Journal of Symbolic Logic 64 (2):918-922.
    Direct download  
     
    Export citation  
     
    My bibliography  
  32. Adam Drozdek (1993). Semantics of Programming Languages and the Theory of Truth. Epistemologia 16 (2):281-310.
     
    Export citation  
     
    My bibliography  
  33. 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.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  34. 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.
    No categories
     
    Export citation  
     
    My bibliography  
  35. Andrzej Skowron (1971). Semantic Translation of Programming Languages. Mathematical Logic Quarterly 17 (1):39-46.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  36.  13
    Jan van Eijck, Haskell Programming With Tests, and Some Alloy.
    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
      Direct download  
     
    Export citation  
     
    My bibliography  
  37.  7
    H. H. Pattee (2008). Physical and Functional Conditions for Symbols, Codes, and Languages. Biosemiotics 1 (2):147-168.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  38. J. Levy, Agustí & Felip Mañá (1992). Functional Lattices for Taxonomic Reasoning. Department of Artificial Intelligence, University of Edinburgh.
     
    Export citation  
     
    My bibliography  
  39.  7
    H. H. Pattee (2008). Physical and Functional Conditions for Symbols, Codes, and Languages. Biosemiotics 1 (2):147-168.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   10 citations  
  40.  5
    Kumiko Tanaka-Ishii (2006). Dyadic Versus Triadic Sign Models in Functional and Object-Oriented Computer Programming Paradigms. Semiotica 2006 (158):213-231.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  41.  1
    Sidnéa Nunes Ferreira (2007). Bridging Theories: A Logical-Functional Perspective on Languages. Semiotica 2007 (167):91-118.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  42. M. Nielsen & E. M. Schmidt (1982). Automata, Languages and Programming Ninth Colloquium, Aarhus, Denmark, July 12-16, 1982.
     
    Export citation  
     
    My bibliography  
  43. Lawrence W. Barsalou (1999). Perceptual Symbol Systems. Behavioral and Brain Sciences 22 (4):577-660.
    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 (14 more)  
     
    Export citation  
     
    My bibliography   254 citations  
  44.  3
    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.
    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 , using the applicative formalism, functional types of categorial grammars and combinatory logic . In the enunciative theory and following , an utterance can be decomposed into two components: a modus (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45.  68
    Giuseppe Primiero (2014). A Taxonomy of Errors for Information Systems. Minds and Machines 24 (3):249-273.
    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 (5 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  46.  62
    Henk Barendregt (1997). The Impact of the Lambda Calculus in Logic and Computer Science. Bulletin of Symbolic Logic 3 (2):181-215.
    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)  
     
    Export citation  
     
    My bibliography   2 citations  
  47.  8
    Jean-Louis Krivine (2001). Typed Lambda-Calculus in Classical Zermelo-Frænkel Set Theory. Archive for Mathematical Logic 40 (3):189-205.
    , 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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  48.  1
    Mauricio Ayala-Rincón, Flávio L. C. de Moura & Fairouz Kamareddine (2005). Comparing and Implementing Calculi of Explicit Substitutions with Eta-Reduction. Annals of Pure and Applied Logic 134 (1):5-41.
    The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous works have illustrated the usefulness of these calculi for practical notions like the implementation of typed functional programming languages and higher order proof assistants. It has also been shown that eta-reduction is useful for adapting substitution calculi for practical problems like higher order unification. This paper concentrates on rewrite rules for eta-reduction in three different styles of explicit substitution calculi: λσ, λse and (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  49. Karl-Heinz Niggl (2005). Control Structures in Programs and Computational Complexity. Annals of Pure and Applied Logic 133 (1-3):247-273.
    A key problem in implicit complexity is to analyse the impact on program run times of nesting control structures, such as recursion in all finite types in functional languages or for-do statements in imperative languages.Three types of programs are studied. One type of program can only use ground type recursion. Another is concerned with imperative programs: ordinary loop programs and stack programs. Programs of the third type can use higher type recursion on notation as in functional (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  50.  1
    Duminda Wijesekera & Anil Nerode (2005). Tableaux for Constructive Concurrent Dynamic Logic. Annals of Pure and Applied Logic 135 (1-3):1-72.
    This is the first paper on constructive concurrent dynamic logic . For the first time, either for concurrent or sequential dynamic logic, we give a satisfactory treatment of what statements are forced to be true by partial information about the underlying computer. Dynamic logic was developed by Pratt [V. Pratt, Semantical considerations on Floyd–Hoare logic, in: 17th Annual IEEE Symp. on Found. Comp. Sci., New York, 1976, pp. 109–121, V. Pratt, Applications of modal logic to programming, Studia Logica 39 (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
1 — 50 / 1000