A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Effects of large arrays on machine organization and hardware/software tradeoffs
1966
Proceedings of the November 7-10, 1966, fall joint computer conference on XX - AFIPS '66 (Fall)
Preserved Fulltext
Many of the ideas covered in this paper are an outgrowth of material developed during a study of "Technology Applications for Tactical Data Systems," sponsored by the Naval Analysis Group of the Office ...
The test results are put in a computer which is also storing logical equations of the function to be implemented. ...
need for developing new and improved types of such peripheral equipments. 3. ...
doi:10.1145/1464291.1464299
dblp:conf/afips/Hobbs66
fatcat:uubhviffr5gr5lxrpgxplemolm
Page 6357 of Mathematical Reviews Vol. , Issue 97J
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
“The conventional system resembles traditional Curry-style typ- ing systems in functional programming languages. Uniqueness typing extends this with reference count information. ...
In both type systems, typing is preserved during evaluation, and types can be determined effectively. Moreover, with respect to a graph rewriting semantics, both type systems turn out to be sound.” ...
Dependent Types, Theorem Proving, and Applications for a Verifying Compiler
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In a functional language programming with dependent types, this capability becomes naturally practical for functional programming languages. ...
computational content and logical annotations. ...
In a functional language programming with dependent types, this capability becomes naturally practical for functional programming languages. ...
doi:10.1007/978-3-540-69149-5_19
fatcat:saqebbd3anay7m3zattxr2s7bi
New Functional Logic Design Patterns
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Patterns distill successful experience in solving common software problems. We introduce a handful of new software design patterns for functional logic languages. ...
Our patterns deal with fundamental aspects of the design and implementation of functional logic programs such as function invocation, data structure representation and manipulation, specification-driven ...
Logic languages support key aspects of this pattern, in particular, the non-determinism of the core function and the possibility of computing a relation and its inverse relation with the same predicate ...
doi:10.1007/978-3-642-22531-4_2
fatcat:ofaaedawwfahlff3x5kvfofbym
Page 133 of University Computing : The Bulletin of the IUCC Vol. 12, Issue 4
[page]
1990
University Computing : The Bulletin of the IUCC
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Functional and logic languages
Functional and logic languages will be discussed separately
in this section, but we start with some general remarks which
apply to both groups. ...
Functional and Logic Languages are therefore seen principally as a good notation; ideal for specifying problems at a high level but not for progressing the specification to the solution. ...
From Logic to Functional Logic Programs
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
To extend logic languages with the compact notation of functional programming, there are various proposals to map evaluable functions into predicates in order to stay in the logic programming framework ...
programming but can improve computations by reducing infinite search spaces to finite ones. ...
In this sense, our results provide a systematic method to improve computations in logic programs by mapping predicates into functions and applying sound and complete evaluation strategies to the transformed ...
arXiv:2205.06841v1
fatcat:du6oucg3zrfptfxrlxhkky55ue
PhD Abstracts
2017
Journal of functional programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Many students complete PhDs in functional programming each year. ...
As a service to the community, the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year. ...
Certification of Programs with Computational Effects Typically, a piece of program with arguments in X that returns a value in Y is not interpreted as a function from X to Y , due to the effects. ...
doi:10.1017/s0956796817000089
fatcat:p2yk5sbqazcuriv33wdtzekcc4
Carnap: An Open Framework for Formal Reasoning in the Browser
2018
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Carnap-based applications are written in Haskell, but can be compiled to JavaScript to run in standard web browsers. ...
This paper presents an overview of Carnap, a free and open framework for the development of formal reasoning applications. ...
by the functions above; (d) data types for a number of particular languages-in particular, languages for propositional logic, propositional modal logic, first-order logic, quantified modal logic, monadic ...
doi:10.4204/eptcs.267.5
fatcat:p4mboadflzbhjkvi4xjmpesxo4
On a modal lambda calculus for S4
1995
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Here, we present a much simpler solution which does not require intersection types. We first describe a new type system inspired in part by linear logic and verify that reductions preserve typings. ...
Finally, we describe a concrete model for an illustrative programming language based on the new type system; this improves on earlier such efforts in that states are not assumed to be structured using ...
Applications include a new formulation of natural deduction for intuitionistic linear logic, modal logical frameworks, and a logical analysis of staged computation and binding-time analysis for functional ...
doi:10.1016/0304-3975(96)80140-x
fatcat:34yi3zt6lndvnb7vsbrnk2wuoa
Improving Lazy Non-Deterministic Computations by Demand Analysis
2012
International Conference on Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional programming with non-deterministic computations from logic programming. ...
We demonstrate the positive effects of this program transformation with KiCS2, a recent highly efficient implementation of the functional logic programming language Curry. ...
Motivation Functional logic languages support the most important features of functional and logic programming in a single language (see [10, 32] for recent surveys). ...
doi:10.4230/lipics.iclp.2012.130
dblp:conf/iclp/Hanus12
fatcat:brk5o7y5rvajrgcoiqkpnxgop4
Syntactic control of interference revisited
1995
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Here, we present a much simpler solution which does not require intersection types. We first describe a new type system inspired in part by linear logic and verify that reductions preserve typings. ...
Finally, we describe a concrete model for an illustrative programming language based on the new type system; this improves on earlier such efforts in that states are not assumed to be structured using ...
Applications include a new formulation of natural deduction for intuitionistic linear logic, modal logical frameworks, and a logical analysis of staged computation and binding-time analysis for functional ...
doi:10.1016/0304-3975(96)80138-1
fatcat:k3rggrbb5zfflbka3rpi243s3a
Objects, interference and the Yoneda embedding
1995
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Here, we present a much simpler solution which does not require intersection types. We first describe a new type system inspired in part by linear logic and verify that reductions preserve typings. ...
Finally, we describe a concrete model for an illustrative programming language based on the new type system; this improves on earlier such efforts in that states are not assumed to be structured using ...
Applications include a new formulation of natural deduction for intuitionistic linear logic, modal logical frameworks, and a logical analysis of staged computation and binding-time analysis for functional ...
doi:10.1016/0304-3975(96)80139-3
fatcat:bqcssjjpjzhnvgj27ohd26ukku
Functional logic programming
2010
Communications of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Compared to purely logic languages, functional logic languages allow functional composition, which improves code modularity, reuse and efficiency of execution. ...
Last but not least, programming in a functional logic language is fun. ...
doi:10.1145/1721654.1721675
fatcat:3jer6iphojcmxmkjh7sv4kdaeu
Page 6675 of Mathematical Reviews Vol. , Issue 94k
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We consider a simple language (equivalent to a fragment of standard ML) of typed, higher-order functions that can dynamically create fresh names; names are created with local scope, can be tested for equal ...
Summary: “This paper presents some supporting transformations for the partial evaluation of logic programs. A logic language is often used to specify a program. ...
The Smyth completion: a common foundation for denotational semantics and complexity analysis
1995
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Applications include a new formulation of natural deduction for intuitionistic linear logic, modal logical frameworks, and a logical analysis of staged computation and binding-time analysis for functional ...
Finally, we describe a concrete model for an illustrative programming language based on the new type system; this improves on earlier such efforts in that states are not assumed to be structured using ...
doi:10.1016/0304-3975(96)80141-1
fatcat:2rpt7dgkkncqjic42lsk5jteqi
« Previous
Showing results 1 — 15 out of 293,387 results