Relevant bibliographies by topics / Intensional programming

Academic literature on the topic 'Intensional programming'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 February 2022

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Intensional programming.'

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.

Journal articles on the topic "Intensional programming"

1

van Otterlo, Martijn. "Intensional dynamic programming. A Rosetta stone for structured dynamic programming." Journal of Algorithms 64, no. 4 (October 2009): 169–91. http://dx.doi.org/10.1016/j.jalgor.2009.04.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Galanaki, Chrysida, Christos Nomikos, and Panos Rondogiannis. "Game semantics for non-monotonic intensional logic programming." Annals of Pure and Applied Logic 168, no. 2 (February 2017): 234–53. http://dx.doi.org/10.1016/j.apal.2016.10.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Orgun, Mehmet A., and William W. Wadge. "Towards a unified theory of intensional logic programming." Journal of Logic Programming 13, no. 4 (August 1992): 413–40. http://dx.doi.org/10.1016/0743-1066(92)90055-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Majkić, Zoran, and Bhanu Prasad. "Intensional FOL for reasoning about probabilities and probabilistic logic programming." International Journal of Intelligent Information and Database Systems 11, no. 1 (2018): 79. http://dx.doi.org/10.1504/ijiids.2018.091627.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Majkić, Zoran, and Bhanu Prasad. "Intensional FOL for reasoning about probabilities and probabilistic logic programming." International Journal of Intelligent Information and Database Systems 11, no. 1 (2018): 79. http://dx.doi.org/10.1504/ijiids.2018.10012745.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cimiano, Philipp, Sebastian Rudolph, and Helena Hartfiel. "Computing intensional answers to questions – An inductive logic programming approach." Data & Knowledge Engineering 69, no. 3 (March 2010): 261–78. http://dx.doi.org/10.1016/j.datak.2009.10.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Plaice, John, Blanca Mancilla, and Gabriel Ditu. "From Lucid to TransLucid: Iteration, Dataflow, Intensional and Cartesian Programming." Mathematics in Computer Science 2, no. 1 (November 2008): 37–61. http://dx.doi.org/10.1007/s11786-008-0043-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

HARRISON, AMELIA, and VLADIMIR LIFSCHITZ. "Stable models for infinitary formulas with extensional atoms." Theory and Practice of Logic Programming 16, no. 5-6 (September 2016): 771–86. http://dx.doi.org/10.1017/s1471068416000314.

Full text
Abstract:
AbstractThe definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a distinction between intensional and extensional atoms. The symmetric splitting theorem for first-order formulas is then extended to infinitary formulas and used to reason about infinitary definitions.
APA, Harvard, Vancouver, ISO, and other styles
9

Balbiani, Philippe. "A Modal Semantics of Negation in Logic Programming." Fundamenta Informaticae 16, no. 3-4 (May 1, 1992): 231–62. http://dx.doi.org/10.3233/fi-1992-163-403.

Full text
Abstract:
The beauty of modal logics and their interest lie in their ability to represent such different intensional concepts as knowledge, time, obligation, provability in arithmetic, … according to the properties satisfied by the accessibility relations of their Kripke models (transitivity, reflexivity, symmetry, well-foundedness, …). The purpose of this paper is to study the ability of modal logics to represent the concepts of provability and unprovability in logic programming. The use of modal logic to study the semantics of logic programming with negation is defended with the help of a modal completion formula. This formula is a modal translation of Clack’s formula. It gives soundness and completeness proofs for the negation as failure rule. It offers a formal characterization of unprovability in logic programs. It characterizes as well its stratified semantics.
APA, Harvard, Vancouver, ISO, and other styles
10

CABALAR, PEDRO, JORGE FANDINNO, LUIS FARIÑAS DEL CERRO, and DAVID PEARCE. "Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates." Theory and Practice of Logic Programming 18, no. 3-4 (July 2018): 390–405. http://dx.doi.org/10.1017/s1471068418000169.

Full text
Abstract:
AbstractIn this paper, we propose a variant of Answer Set Programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, we start from the syntax of First Order Logic with equality and the semantics of Quantified Equilibrium Logic with evaluable functions (${\rm QEL}^=_{\cal F}$). Then, we proceed to incorporate a new kind of logical term,intensional set(a construct commonly used to denote the set of objects characterised by a given formula), and to extend${\rm QEL}^=_{\cal F}$semantics for this new type of expression. In our extended approach, intensional sets can be arbitrarily used as predicate or function arguments or even nested inside other intensional sets, just as regular first-order logical terms. As a result, aggregates can be naturally formed by the application of some evaluable function (count,sum,maximum, etc) to a set of objects expressed as an intensional set. This approach has several advantages. First, while other semantics for aggregates depend on some syntactic transformation (either via a reduct or a formula translation), the${\rm QEL}^=_{\cal F}$interpretation treats them as regular evaluable functions, providing a compositional semantics and avoiding any kind of syntactic restriction. Second, aggregates can be explicitly defined now within the logical language by the simple addition of formulas that fix their meaning in terms of multiple applications of some (commutative and associative) binary operation. For instance, we can use recursive rules to definesumin terms of integer addition. Last, but not least, we prove that the semantics we obtain for aggregates coincides with the one defined by Gelfond and Zhang for the${\cal A}\mathit{log}$language, when we restrict to that syntactic fragment.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Intensional programming"

1

Ahmad, Kassem Ahmad. "Programming Networks with Intensional Destinations." Phd thesis, INSA de Lyon, 2013. http://tel.archives-ouvertes.fr/tel-00908354.

Full text
Abstract:
La programmation distribuée est une tâche difficile. Elle a énormément gagné en importance avec le développement des réseaux qui supportent un nombre croissant exponentiellement d'applications. Les systèmes distribués fournissent des fonctionnalités assurées par les noeuds qui forment un réseau et échangent des données et services, éventuellement par le biais de messages. La provenance du service n'est souvent pas pertinente, alors que sa fiabilité est essentielle. Notre objectif est de fournir un nouveau modèle de communication qui permet de spécifier intentionnellement lequel service est demandé, et non les noeuds qui le fournissent. Cette spécification intentionnelle des échanges offre un potentiel pour faciliter la programmation distribuée, garantir la persistance des données dans les messages et la résilience des systèmes, qui constituent le sujet de cette thèse. Nous proposons donc un cadre qui supporte des messages avec destinations intentionnelles, qui sont évaluées uniquement à la volée au fur et à mesure du déplacement des messages. Nous introduisons un langage, Questlog, qui gère les destinations intentionnelles. Contrairement aux langages à base de règles existants pour les réseaux, comme Datalog, qui suivent le mode push, Questlog permet d'exprimer des stratégies complexes afin de récupérer de manière récursive des données distribuées en mode pull. Le langage fonctionne sur une machine virtuelle qui s'appuie sur un SGBD. Nous démontrons l'approche avec des exemples pris dans deux domaines: (i) les architectures orientées données, où une classe restreinte d'applications client-serveur sont distribuées de manière transparente sur les systèmes pair-à-pair basés sur une DHT, (ii) les réseaux de capteurs sans fil, où un protocole de groupement des noeuds en clusters virtuels est proposé pour agréger les données. Dans ce protocole, les chefs des clusters sont élus à l'aide des destinations intentionnelles. Nos simulations sur la plate-forme QuestMonitor montrent que cette approche offre une simplicité, une modularité aux protocoles, ainsi qu'une fiabilité accrue.
APA, Harvard, Vancouver, ISO, and other styles
2

Zhao, Qin. "Implementation of an object-oriented intensional programming system." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ35547.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kavvos, Georgios Alexandros. "On the semantics of intensionality and intensional recursion." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:f89b46d8-b514-42fd-9321-e2803452681f.

Full text
Abstract:
Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equality. This is a familiar setting for computer scientists, who often study different programs or processes that are interchangeable, i.e. extensionally equal, even though they are not implemented in the same way, so intensionally distinct. Concomitant with intensionality is the phenomenon of intensional recursion, which refers to the ability of a program to have access to its own code. In computability theory, intensional recursion is enabled by Kleene's Second Recursion Theorem. This thesis is concerned with the crafting of a logical toolkit through which these phenomena can be studied. Our main contribution is a framework in which mathematical and computational constructions can be considered either extensionally, i.e. as abstract values, or intensionally, i.e. as fine-grained descriptions of their construction. Once this is achieved, it may be used to analyse intensional recursion. To begin, we turn to type theory. We construct a modal λ-calculus, called Intensional PCF, which supports non-functional operations at modal types. Moreover, by adding Löb's rule from provability logic to the calculus, we obtain a type-theoretic interpretation of intensional recursion. The combination of these two features is shown to be consistent through a confluence argument. Following that, we begin searching for a semantics for Intensional PCF. We argue that 1-category theory is not sufficient, and propose the use of P-categories instead. On top of this setting we introduce exposures, which are P-categorical structures that function as abstractions of well-behaved intensional devices. We produce three examples of these structures, based on Gödel numberings on Peano arithmetic, realizability theory, and homological algebra. The language of exposures leads us to a P-categorical analysis of intensional recursion, through the notion of intensional fixed points. This, in turn, leads to abstract analogues of classic intensional results in logic and computability, such as Gödel's Incompleteness Theorem, Tarski's Undefinability Theorem, and Rice's Theorem. We are thus led to the conclusion that exposures are a useful framework, which we propose as a solid basis for a theory of intensionality. In the final chapters of the thesis we employ exposures to endow Intensional PCF with an appropriate semantics. It transpires that, when interpreted in the P-category of assemblies on the PCA K1, the Löb rule can be interpreted as the type of Kleene's Second Recursion Theorem.
APA, Harvard, Vancouver, ISO, and other styles
4

Rondogiannis, Panagiotis. "Higher-order functional languages and intensional logic." Thesis, 1994. http://hdl.handle.net/1828/5960.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ditu, Gabriel Cristian Computer Science &amp Engineering Faculty of Engineering UNSW. "The programming language TransLucid." 2007. http://handle.unsw.edu.au/1959.4/40701.

Full text
Abstract:
This thesis presents TransLucid, a low-level, purely declarative, intensional programming language. Built on a simple algebra and with just a small number of primitives, TransLucid programs define arbitrary dimensional infinite data structures, which are then queried to produce results. The formal foundations of TransLucid come from the work in intensional logic by Montague and Scott. The background chapters give a history of intensional logic and its predecessors in the Western world, as well as a history of intensional programming and Lucid, the first intensional programming language. The semantics of TransLucid are fully specified in the form of operational semantics. Three levels of semantics are given, in increasing order of efficiency, with the sequential warehouse semantics, the most efficient, being presented together with a proof that any expression will be evaluated by only examining relevant dimensions in the current context. The language is then extended in three important ways, by adding versioned identifiers, (declarative) side-effects and timestamped equations and demands. Adding versioned identifiers to TransLucid enriches the expressiveness of the language and allows the encoding of a variety of programming paradigms, ranging from manipulating large data-cubes to pattern-matching. Adding side-effects supports one of the main reasons for TransLucid: namely, to provide a target language, together with a methodology, for translating the main programming paradigms, thus creating a uniform end platform that can be the focus for optimisation and program verification. A translation of imperative programs into TransLucid is given. Timestamped equations and demands enable TransLucid to become a language for synchronous programming in real-time systems, as well as allowing runtime updates to a program's equations. The language TransLucid represents a decisive advance in declarative programming. It has applications in many fields of computer science and opens up exciting new avenues of research.
APA, Harvard, Vancouver, ISO, and other styles
6

Little, Richard. "Intensional Context-Free Grammar." Thesis, 2013. http://hdl.handle.net/1828/5120.

Full text
Abstract:
The purpose of this dissertation is to develop a new generative grammar, based on the principles of intensional logic. More specifically, the goal is to create a psychologically real grammar model for use in natural language processing. The new grammar consists of a set of context-free rewrite rules tagged with intensional versions. Most generative grammars, such as transformational grammar, lexical functional-grammar and head-driven phrase structure grammar, extend traditional context-free grammars with a mechanism for dealing with contextual information, such as subcategorization of words and agreement between different phrasal elements. In these grammars there is not enough separation between the utterances of a language and the context in which they are uttered. Their models of language seem to assume that context is in some way encapsulated in the words of the language instead of the other way around. In intensional logic, the truth of a statement is considered in the context in which it is uttered, unlike traditional predicate logic in which truth is assigned in a vacuum, regardless of when or where it may have been stated. To date, the application of the principles of intensionality to natural languages has been confined to semantic theory. We remedy this by applying the ideas of intensional logic to syntactic context, resulting in intensional context-free grammar. Our grammar takes full advantage of the simplicity and elegance of context-free grammars while accounting for information that is beyond the sentence itself, in a realistic way. Sentence derivation is entirely encapsulated in the context of its utterance. In fact, for any particular context, the entire language of the grammar is encapsulated in that context. This is evidenced by our proof that the language of an intensional grammar is a set of context-free languages, indexed by context. To further support our claims we design and implement a small fragment of English using the grammar. The English grammar is capable of generating both passive and active sentences that include a subject, verb and up to two optional objects. Furthermore, we have implemented a partial French to English translation system that uses a single language dimension to initiate a translation. This allows us to include multiple languages in one grammar, unlike other systems which must separate the grammars of each language. This result has led this author to believe that we have created a grammar that is a viable candidate for a true Universal Grammar, far exceeding our initial goals.
Graduate
0984
0800
0290
rlittle@uvic.ca
APA, Harvard, Vancouver, ISO, and other styles
7

Jin, Xing. "Authoring tools for intensional markup." Thesis, 2006. http://hdl.handle.net/1828/1954.

Full text
Abstract:
Several tools have been developed for the authoring of intensional (context-sensitive) documents; for example. IHTML (Intensional HTML), IML (Intensional Markup Language). and ISE (Intensional Sequential Evaluator). However, at present, it is still very difficult to author intensional markup documents. To ease this difficulty. this thesis presents two new intensional authoring tools. IMP (Intensional Macro Processor) and ICC (Intensional C Compiler). IMP is a powerful yet easy to use macro processor embedded with a JavaScript engine. ICC in turn is an intensional extension to ANSI C. Several applications of IMP and ICC such as WIMPAS. intensional spreadsheet and CGI programming in ICC are discussed in this thesis to illustrate how IMP and ICC facilitate intensional authoring.
APA, Harvard, Vancouver, ISO, and other styles
8

Hoke, Yatang. "An authoring tool for temporal intensional web pages." Thesis, 2005. http://hdl.handle.net/1828/48.

Full text
Abstract:
ITPerl is a web authoring tool that enables users to add temporal features to intensional web pages. ITPerl adds temporal macros to IPerl, a Perl interface to the C++ intense library. ITPerl combines temporal and default logic with intensional programming. ITPerl is an ideal solution for many time-sensitive and rapidly changing web applications. When developing a site, a user can add a temporal section to a webpage by providing different versions of it and associating each version with a time constraint. When a webpage is requested by a browser, a time point will be sent, as part of the request, to the ITPerl module. This time point is by default the current server time, but can be any time specified by the viewer. ITPerl will then compare the time point with each time constraint. If the time point satisfies more than one time constraint, then ITPerl will choose the best-fit version of the section by finding the most refined constraint. A html page that contains this best-fit version of this section will then be generated and sent back to the browser. ITPerl is easy to use. It provides the user with high level macros that have a simple syntax and that generate temporal codes as cgi files. This frees the user from having to write the complex temporal code himself.
APA, Harvard, Vancouver, ISO, and other styles
9

Lu, Bo. "Developing the distributed component of a framework for processing intensional programming languages." Thesis, 2004. http://spectrum.library.concordia.ca/7853/1/NQ90395.pdf.

Full text
Abstract:
Based on a simple non-procedural language with temporal logic operators, Lucid underlies a family of multi-dimensional programming languages based on intensional logic. Intension is a concept rooted in an aspect of natural language called "intensional context", in which the meaning of a statement (extension) depends on the context in which it is uttered (intension). The implicit temporal feature of Lucid makes it suitable for use as a means of describing dynamic systems. In the past, experiments have been performed and real applications have been developed with programs written in Lucid. However, these systems focused mainly on improving the execution performance of one dialect of Lucid and not address the problem of interpreting variants of Lucid. The GIPSY system is designed to not only process current Lucid variants efficiently but also to be modified easily to accept new dialects of Lucid. In the thesis, we discuss the essence of executing intensional programming languages using the eduction (also called demand-driven or lazy ) execution model; describe experiments with different approaches to interpreting programs written in Lucid; and focuses on execution over a network of processors. We describe the implementation of a prototype for executing Lucid programs in a distributed environment. We also explore the advantages of applying the object concept to distributed systems and describe experiments with these methods. In addition, the thesis includes estimates of the impact of integrating computation functions into the Lucid code and proposes an advanced execution model consisting of self-contained and intelligent clients associated with a meta-level resource management.
APA, Harvard, Vancouver, ISO, and other styles
10

Mokhov, Serguei A. "Towards Hybrid Intensional Programming with JLucid, Objective Lucid, and General Imperative Compiler Framework in the GIPSY." Thesis, 2005. http://spectrum.library.concordia.ca/6439/1/0907.2640v3.pdf.

Full text
Abstract:
Pure Lucid programs are concurrent with very fine granularity. Sequential Threads (STs) are functions introduced to enlarge the grain size; they are passed from server to workers by Communication Procedures (CPs) in the General Intensional Programming System (GIPSY). A JLucid program combines Java code for the STs with Lucid code for parallel control. Thus first, in this thesis, we describe the way in which the new JLucid compiler generates STs and CPs. JLucid also introduces array support. Further exploration goes through the additional transformations that the Lucid family of languages has undergone to enable the use of Java objects and their members, in the Generic Intensional Programming Language (GIPL), and Indexical Lucid: first, in the form of JLucid allowing the use of pseudo-objects, and then through the specifically-designed the Objective Lucid language. The syntax and semantic definitions of Objective Lucid and the meaning of Java objects within an intensional program are provided with discussions and examples. Finally, there are many useful scientific and utility routines written in many imperative programming languages other than Java, for example in C, C++, Fortran, Perl, etc. Therefore, it is wise to provide a framework to facilitate inclusion of these languages into the GIPSY and their use by Lucid programs. A General Imperative Compiler Framework and its concrete implementation is proposed to address this issue.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Intensional programming"

1

Hofmann, Martin. Extensional constructs in intensional type theory. Berlin: Springer, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Luis, Fariñas del Cerro, and Penttonen Martti 1948-, eds. Intensional logics for programming. Oxford [England]: Clarendon Press, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Applications of intensional logic to program semantics. Buffalo, N.Y: State University of New York at Buffalo, Dept. of Computer Science, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Manolis, Gergatsoulis, Rondogiannis Panos, and ISLIP '99 (1999 : Athens, Greece), eds. Intensional programming II: Based on the papers at ISLIP '99. Singapore: World Scientific, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

(Editor), Manolis Gergatsoulis, and Panos Rondogiannis (Editor), eds. Intensional Programming II: Based on the Papers at Islip '99. World Scientific Publishing Company, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ashcroft, E. A., A. A. Faustini, R. Jaggannathan, and W. W. Wadge. Multidimensional Programming. Oxford University Press, 1995. http://dx.doi.org/10.1093/oso/9780195075977.001.0001.

Full text
Abstract:
This book describes a powerful language for multidimensional declarative programming called Lucid. Lucid has evolved considerably in the past ten years. The main catalyst for this metamorphosis was the discovery that Lucid is based on intensional logic, one commonly used in studying natural languages. Intensionality, and more specifically indexicality, has enabled Lucid to implicitly express multidimensional objects that change, a fundamental capability with several consequences which are explored in this book. The author covers a broad range of topics, from foundations to applications, and from implementations to implications. The role of intensional logic in Lucid as well as its consequences for programming in general is discussed. The syntax and mathematical semantics of the language are given and its ability to be used as a formal system for transformation and verification is presented. The use of Lucid in both multidimensional applications programming and software systems construction (such as a parallel programming system and a visual programming system) is described. A novel model of multidimensional computation--education--is described along with its serendipitous practical benefits for harnessing parallelism and tolerating faults. As the only volume that reflects the advances over the past decade, this work will be of great interest to researchers and advanced students involved with declarative language systems and programming.
APA, Harvard, Vancouver, ISO, and other styles
7

A, Orgun Mehmet, Ashcroft Edward A, and ISLIP '95 (1995 : Macquarie University), eds. Intensional programming I: Based on the papers at ISLIP '95, Macquarie University, Sydney, NSW, Australia, 3-5 May 1995. Singapore: World Scientific, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Intensional programming"

1

Dovier, A., E. Pontelli, and G. Rossi. "Intensional Sets in CLP." In Logic Programming, 284–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-24599-5_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Muñoz-Hernández, Susana, Julio Mariño, and Juan José Moreno-Navarro. "Constructive Intensional Negation." In Functional and Logic Programming, 39–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24754-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Weirich, Stephanie. "Encoding Intensional Type Analysis." In Programming Languages and Systems, 92–106. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45309-1_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alagar, Vasu S., Joey Paquet, and Kaiyu Wan. "Intensional Programming for Agent Communication." In Declarative Agent Languages and Technologies II, 239–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11493402_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Weirich, Stephanie. "Higher-Order Intensional Type Analysis." In Programming Languages and Systems, 98–114. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45927-8_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cerro, Luis Fariñas, and Andreas Herzig. "Metaprogramming through intensional deduction: Some examples." In Meta-Programming in Logic, 11–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56282-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Castellan, Simon, and Hugo Paquet. "Probabilistic Programming Inference via Intensional Semantics." In Programming Languages and Systems, 322–49. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-17184-1_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Galanaki, Chrysida, Christos Nomikos, and Panos Rondogiannis. "Game Semantics for Non-monotonic Intensional Logic Programming." In Logic Programming and Nonmonotonic Reasoning, 329–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40564-8_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Acar, Aybar C., and Amihai Motro. "Intensional Encapsulations of Database Subsets via Genetic Programming." In Lecture Notes in Computer Science, 365–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11546924_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Talcott, Carolyn. "Rum an intensional theory of function and control abstractions." In Foundations of Logic and Functional Programming, 1–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19129-1_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Intensional programming"

1

Gergatsoulis, Manolis, and Panos Rondogiannis. "Intensional Programming II." In 12th International Symposium. WORLD SCIENTIFIC, 2000. http://dx.doi.org/10.1142/9789814527019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Orgun, Mehmet A., and Edward A. Ashcroft. "Intensional Programming I." In ISLIP '95. WORLD SCIENTIFIC, 1996. http://dx.doi.org/10.1142/9789814532273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wu, Aihua, Joey Paquet, and Serguei A. Mokhov. "Object-Oriented Intensional Programming: Intensional Java/Lucid Classes." In 2010 Eighth ACIS International Conference on Software Engineering Research, Management and Applications. IEEE, 2010. http://dx.doi.org/10.1109/sera.2010.29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Brown, Matt, and Jens Palsberg. "Typed self-evaluation via intensional type functions." In POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3009837.3009853.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mokhov, Serguei A., and Joey Paquet. "Using the General Intensional Programming System (GIPSY) for Evaluation of Higher-Order Intensional Logic (HOIL) Expressions." In 2010 Eighth ACIS International Conference on Software Engineering Research, Management and Applications. IEEE, 2010. http://dx.doi.org/10.1109/sera.2010.23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Matthes, Ralph. "Verification of Programs on Truly Nested Datatypes in Intensional Type Theory." In Workshop on Mathematically Structured Functional Programming (MSFP 2006). BCS Learning & Development, 2006. http://dx.doi.org/10.14236/ewic/msfp2006.10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mokhov, Serguei A., Joey Paquet, and Xin Tong. "A type system for hybrid intensional-imperative programming support in GIPSY." In the 2009 C3S2E conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1557626.1557642.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Paquet, Joey, Aihua Wu, and Peter Grogono. "Towards a framework for the general intensional programming compiler in the GIPSY." In Companion to the 19th annual ACM SIGPLAN conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1028664.1028731.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Intensional programming' for particular source types:
Journal articles
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!

To the bibliography