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
An approach to completing variable names for implicitly typed functional languages
2012
Higher-Order and Symbolic Computation
Preserved Fulltext
This paper presents an approach to completing variable names when writing programs in implicitly typed functional languages. ...
With this assumption we specify a variable completion problem for an implicitly typed core functional language with letpolymorphism and show an algorithm for solving the problem. ...
Acknowledgments We would like to thank the anonymous referees for many helpful comments and for pointing out the paper in ASE 2008. ...
doi:10.1007/s10990-013-9095-x
fatcat:3o65l2abtvg43bxbtv2fpkoiwi
Names and higher-order functions
2015
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.
Even without all these features, the interaction of name creation with higher-order functions can be complex and subtle. ...
As a very basic example of state, they capture the graduation between private and public, local and global, by their interaction with higher-order functions. ...
These demonstrate the subtle and complex behaviour that can arise from the combination of names with higher-order functions. ...
doi:10.17863/cam.15863
fatcat:rjvfbdidkjfxzpuiwdqqujioym
A Higher-Order Specification of the π-Calculus
[chapter]
2000
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 2019; you can also visit the original URL.
The file type is application/pdf.
The encoding of the π-calculus in Coq uses Coq functions to represent bindings of variables. This kind of encoding is called a higher-order specification. ...
We give the rules for type-checking and for evaluation and formalize a proof of type preservation in the Coq system. ...
Our description of the calculus comes out of many discussions we had, trying to understand and formalize the binding mechanism in the π-calculus. ...
doi:10.1007/3-540-44929-9_30
fatcat:t5oofqhkgjhzrbx5rkbbtt64cu
Natural contingencies in the creation of naming as a higher order behavior class
1996
Journal of The Experimental Analysis of Behavior
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 2020; you can also visit the original URL.
The file type is application/pdf.
Higher Order Functional Classes Higher order classes are functional classes, or classes with common behavioral functions either produced by similar histories or acquired through emergent relations. ...
In Horne and Lowe's treatment, naming is an example of a higher order behavior class. ...
doi:10.1901/jeab.1996.65-276
pmid:16812790
pmcid:PMC1350085
fatcat:tg4jskdbyfbbll3hodw6o35gga
XQuery in the Functional-Logic Language Toy
[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 2020; you can also visit the original URL.
The file type is application/pdf.
With this aim, XQuery expressions are converted into higher order patterns that can be analyzed and modified by T OY functions. ...
The encoding is based on the definition of for-let-where-return constructors by means of T OY functions, and uses the recently proposed XPath implementation for this language as a basis. ...
In functional and functional-logic languages, a different approach is possible: XPath queries can be represented by higher-order functions connected by higher-order combinators. ...
doi:10.1007/978-3-642-22531-4_3
fatcat:kcdkjtuqsbfkxce6eoytybszcu
Using circular programs for higher-order syntax
2013
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming - ICFP '13
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 2020; you can also visit the original URL.
The file type is application/pdf.
This pearl presents a novel technique for constructing a firstorder syntax tree directly from a higher-order interface. ...
Our motivating application is the design of embedded languages supporting variable binding, where it is convenient to use higher-order syntax when constructing programs, but firstorder syntax when processing ...
We would like to thank Anders Persson, Jean-Philippe Bernady, Joel Svensson, Josef Svenningsson, Mary Sheeran and Michał Pałka for useful input on this pearl. ...
doi:10.1145/2500365.2500614
dblp:conf/icfp/AxelssonC13
fatcat:nimkrl7yrrc3hgpubijzuhs4v4
Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)
[chapter]
2014
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 2019; you can also visit the original URL.
The file type is application/pdf.
Higher-order languages have been widely studied in functional programming, following the λ-calculus. In a higher-order calculus, variables may be instantiated with terms of the language. ...
Finding effective methods for equivalence proofs is particularly challenging in higher-order languages: pure functional languages like the λ-calculus, and richer languages including nonfunctional features ...
Summary Higher-order languages have been widely studied in functional programming, following the λ-calculus. In a higher-order calculus, variables may be instantiated with terms of the language. ...
doi:10.1007/978-3-662-44124-4_1
fatcat:jmcahmpdejauveabvhsxrftwgy
Page 443 of The Philosophical Review Vol. 51, Issue 5
[page]
1942
The Philosophical Review
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Every name may become implicative and assume its double function. The lin- guists assert that such class-names as “horse” were originally proper names; they later assumed the class function. ...
Fauntleroy became such a principle of order because of our resolve to turn a particular occurrence into a paradigm and make it function as such. ...
Modular polymorphic defunctionalization
2014
Computer Science and Information Systems
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.
In this paper, we formalize a modular variant of defunctionalization which can support separate compilation for a functional programming language with parametric polymorphism. ...
Defunctionalization is generally considered a whole-program transformation and thus incompatible with separate compilation. ...
This research has been co-financed by the European Union (European Social Fund -ESF) and Greek national funds through the Operational Program "Education and Lifelong Learning" of the National Strategic ...
doi:10.2298/csis130923030f
fatcat:tquan4zczfedtlyabq2wjzq3ai
An Integration of HOL and ACL2
2006
2006 Formal Methods in Computer Aided Design
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.
The initial ACL2 theory has been defined inside HOL, so that it is possible to prove mechanically that first-order ACL2 functions on S-expressions correspond to higherorder functions operating on a variety ...
importing ACL2 definitions and theorems into HOL, to specify and verify properties that cannot easily be stated in the first-order ACL2 logic. ...
Konrad Slind has made major contributions to the ideas and also to our tools. In particular, he helped us implement acl2Define. ...
doi:10.1109/fmcad.2006.6
dblp:conf/fmcad/GordonRHK06
fatcat:wcy2xzxrenhtfkjcyumjwkfidi
Functions as objects in a data flow based visual language
1993
Proceedings of the 1993 ACM conference on Computer science - CSC '93
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.
For example, Figure 1 shows an example of a higher order function using this approach (based on DataVis). The higher order function Iterate contains F, a first order function in its function slot. ...
The PHF implementation of Higher Order Functions PHF implements higher order functions by treating vips as data objects which can flow over connectors. ...
doi:10.1145/170791.170832
dblp:conf/acm/FukunagaPK93
fatcat:kkrqq5pjezbmziacbw225alopm
Supporting Separate Compilation in a Defunctionalizing Compiler
2013
Symposium on Languages, Applications and Technologies
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 2016; you can also visit the original URL.
The file type is application/pdf.
Papaspyrou Separate Compilation and Defunctionalization 2 / 23 Uses of Defunctionalization 1 Implementation of higher-order source languages with first-order target languages (MLton, GRIN) 2 Inter-derivation ...
Defunctionalization Transforms a higher-order program to an equivalent first-order one (Reynolds, 1972) Requirement: the language of the target program must support data types with different constructors ...
qualifiers are considered parts of the names of functions, data types and constructors 3 all module boundaries have been eliminated; programs are lists of data type declarations and function definitions ...
doi:10.4230/oasics.slate.2013.39
dblp:conf/slate/FourtounisP13
fatcat:tztgwc6p6va6ljxtxpul3kfsh4
Higher-order port-graph rewriting
2012
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
We illustrate the expressive power of higher-order port-graphs with examples taken from proof-net reduction systems. ...
We provide a matching algorithm which enables to implement higher-order port-graph rewriting in PORGY, thus one can visually study the dynamics of the systems modelled. ...
∇ N ∪ X N and lv : V → X G are labelling functions associating first-order names to firstorder nodes, and higher-order names to higher-order nodes. ...
doi:10.4204/eptcs.101.3
fatcat:m4xd3euuovag5cqc5cbqg24ym4
Streams that compose using macros that oblige
2012
Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation - PEPM '12
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.
This paper introduces higher-order composite operators, which encapsulate stream subgraphs, and contracts, which specify pre-and post-conditions for composites. ...
name capture. ...
We are grateful to John Field, Robert Grimm, Byeongcheol Lee, Rodric Rabbah, Scott Schneider, and Robert Soulé for feedback on earlier drafts of this paper. ...
doi:10.1145/2103746.2103772
dblp:conf/pepm/HirzelG12
fatcat:gw2owosiwve33njncw4aeehhla
An observationally complete program logic for imperative higher-order functions
2014
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 2007; you can also visit the original URL.
The file type is application/pdf.
A systematic use of names and operations on them allows precise and general description of complex higher-order imperative behaviour. ...
We propose a simple compositional program logic for an imperative extension of call-by-value PCF, built on Hoare logic and our preceding work on program logics for pure higher-order functions. ...
Pure Higher-Order Functions. In the present approach to program logics, behaviour is asserted by naming them. ...
doi:10.1016/j.tcs.2013.11.003
fatcat:qmcwa7xoujai7plsnczcbpkqse
« Previous
Showing results 1 — 15 out of 3,570,716 results