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
Aggregation problems, formulation of several versions, analysis from recursion theoretic point of view, 70, 69 Algorithms for circular retrieval and k-nearest neighbor search problems, description and ... analysis, 68, 105 for computing properties and functions of n-node forest stored in processor mesh, 69, 168 deterministic, applications to optimal parallel list ranking, 70, 32 network resource allocation ... temporal logics, probabilistic propositional temporal logic based on, description of two versions, 70, 97 C Calculus lambda and categorical combinatory logic, syn- tactic equivalence theorem, ...doi:10.1016/s0019-9958(86)80014-6 fatcat:hkligygazvcyvdgrhtvhrefpj4
“The system serves as a platform for certain higher-order gen- eralisations of Bellantoni-Cook’s function algebra capturing poly- nomial time using a separation of the variables into ‘safe’ and ‘normal ... “The proofs associated with these applications are based on an interpretation of the lambda calculus in a category-theoretic model in which all functions are polynomial time computable by construction. ...
In 1984, Reynolds showed that there were no models of the poly- morphic lambda calculus in which types were interpreted as arbi- trary sets and the function space was interpreted as the full set of functions ... The paper is concerned with applied forms of (extensions of) the second-order lambda calculus. ...
characterizations of poly-time (274-288); James McKinna and Robert Pollack, Pure 68 COMPUTER SCIENCE 1038 type systems formalized (289-305); Tobias Nipkow, Orthogonal higher-order rewrite systems are ... 244); Achim Jung and Jerzy Tiuryn, A new characterization of lambda definability (245-257); Hans Leiss, Combining recursive and dynamic types (258-273); Daniel Leivant and Jean-Yves Marion, Lambda calculus ...
These annotations take the form of terms in the resource lambda-calculus. We generalize this resource-driven Krivine machine to the case of the algebraic lambda-calculus. ... The Krivine machine is an abstract machine implementing the linear head reduction of lambda-calculus. ... Resource lambda calculus We recall the syntax and the reduction of the resource λ -calculus which has been defined in  . ...doi:10.4204/eptcs.238.3 fatcat:ocborfr3lvgd7chfacg7divqha
the lambda calculus (420-431); Peter Selinger, Order-incompleteness and fi- nite lambda models (extended abstract) (432-439); César Mufioz, Confluence and preservation of strong normalisation in an explicit ... Ong, A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations (preliminary ex- tended abstract) (230-241); Martin Abadi and Marcelo P. ...
Chapter 9 con- tinues with semantics of untyped lambda calculus, pers, and an interesting complete axiomatization of the valid isomorphisms in arbitrary ccc’s (the proof uses a highly nontrivial characterization ... Chapters 11 and 12 are a very formal treatment of categorical models of Girard’s second-order lambda calculus, and a detailed comparison of external Seely models (using indexed categories) versus the somewhat ...
., Functions over free algebras definable in the simply typed lambda calculus, Theoretical Computer Science 121 (1993) 309-321. ... Monotonic recurrence here is the generalization of iteration-with-parameters from N to bitrary free algebras, and our predicativity condition uses the notion of tiers introduced ,by_ Lel? ant (1990). ... It was discovered independently (in a slightly different guise) by Bellantoni and Cook  , who used it to give a subrecursive characterization of the poly-time functions. ...doi:10.1016/0304-3975(93)90092-8 fatcat:iazaywohpzejniihtxdcvcri34
This is done by translating programs of the language into terms of the typed lambda calculus. Our translation, however, does not always yield a well-typed lambda term. ... We show how a programming language designer may embed the type structure of of a programming language in the more robust type structure of the typed lambda calculus. ... Albert Meyer suggested investigating continuation semantics in a typed domain, leading to the definition of 7. We thank Dan Friedman for his comments on the first draft of this paper. ...doi:10.1145/318593.318602 dblp:conf/popl/Wand85 fatcat:yqxnaz6dzvcylg5mvmaaova6ie
Consider the following problem: given a simply typed lambda term of Boolean type and of order r, does it normalize to "true"? ... A related problem is: given a term M of word type and of order r together with a finite automaton D, does D accept the word represented by the normal form of M ? ... Acknowledgements We would like to thank Masahito Hasegawa, Naohiko Hoshino and Shin'ya Katsumata for pointers to the literature, and anonymous referees for a lot of useful comments. ...doi:10.4230/lipics.rta.2012.323 dblp:conf/rta/Terui12 fatcat:gfj6qlibuvbqnh5uo3erfa3rie
Wagner (D-WRZB-TI; Wirzburg) 95c:03095 03D15 03B40 68Q15 Leivant, Daniel (1-IN-C; Bloomington, IN); Marion, Jean-Yves (1-IN-C; Bloomington, IN) Lambda calculus characterizations of poly-time. ... This paper contains some nice characterizations of the PTIME functions inside A-calculus. ...
[Révész, Gyérgy E.] (1-IBM) * Lambda-calculus, combinators, and functional programming. Cambridge Tracts in Theoretical Computer Science, 4. ... This theorem has been used by MacQueen, Plotkin, and Sethi in the ideal model of recursive poly- morphic types. ...
We present a polymorphic type system for lambda calculus ensuring that well-typed programs can be executed in polynomial time: dual light affine logic (DLAL). ... We also give a translation of LAL into DLAL and deduce from it that all polynomial time functions can be represented in DLAL. ... So the reduction of LAL-typed lambda terms is not strongly poly-step (when counting the number of reduction steps). ...doi:10.1016/j.ic.2008.08.005 fatcat:vtr4yo6kz5dsfp6qzoqe3szxte
A natural-deduction formulation of these systems map directly, via a Curry-Howard morphism, to terms of the simply typed lambda calculus with recurrence, with a termination proof for a function f mapping ... When only a "predicative" form of induction is allowed we obtain the Kalmar elementary functions. The combination of both restrictions yields the functions computable in polynomial time. ... Since poly-time has rather simple proof-theoretic characterizations (e.g. ...doi:10.1007/978-0-387-35608-2_41 dblp:conf/ifipTCS/Leivant02 fatcat:pq322qal2rdvxm7s3xmocmuz3u
Summary: “From a constructive proof of strong normalization plus uniqueness of the long beta-normal form for the simply typed lambda calculus, a normalization program is extracted us- ing Kreisel’s modified ... Summary: “An exact algebraic method for computing the two- terminal reliabilities in a network is approximated to yield an effective upper bound that can be computed in time that is poly- nomial in the ...
« Previous Showing results 1 — 15 out of 288 results