Filters








3,716 Hits in 5.8 sec

A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract) [article]

Peter Selinger Dalhousie University,
2008 arXiv   pre-print
We give a categorical semantics for a call-by-value linear lambda calculus.  ...  Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming language for quantum computation.  ...  Conclusion We have developed a call-by-value, computational lambda-calculus for manipulating duplicable and non-duplicable data, together with an axiomatic equivalence relation on typed terms.  ... 
arXiv:0801.0813v1 fatcat:ryf5svfuyvh6dfjyq5pogwdf74

A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract) [chapter]

Peter Selinger, Benoît Valiron
Foundations of Software Science and Computational Structures  
We give a categorical semantics for a call-by-value linear lambda calculus.  ...  Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming language for quantum computation.  ...  Towards a Denotational Model of Quantum Lambda Calculus As noted in the introduction, this paper is mostly concerned with the categorical requirements for modeling a generic call-by-value linear lambda  ... 
doi:10.1007/978-3-540-78499-9_7 dblp:conf/fossacs/SelingerV08 fatcat:sc5e6vnzhrbzbkyjuuxa4lespa

On Quantum and Probabilistic Linear Lambda-calculi (Extended Abstract)

Benoît Valiron
2011 Electronical Notes in Theoretical Computer Science  
In this paper we give a fully complete model for a linear probabilistic lambda-calculus. The model is a Kripke semantics based on the category of stochastic relations.  ...  We sketch how this relates to quantum computation.  ...  Acknowledgement I would like to thanks Peter Selinger for suggesting the problem of characterizing the definable higher-order probabilistic functions, and for providing the counterexample in Section 7.  ... 
doi:10.1016/j.entcs.2011.01.011 fatcat:iah3slvv7vbyzoawbw5tbfn3yi

Abstracting abstract control

James Ian Johnson, David Van Horn
2014 Proceedings of the 10th ACM Symposium on Dynamic languages - DLS '14  
The approach, so called because it derives a function for the sound and computable approximation of program behavior starting from the abstract machine semantics of a language, provides a viable approach  ...  We revise the abstracting abstract machines technique to target the stronger computational model of pushdown systems. In place of automata theory, we use only abstract machines and memoization.  ...  The method is strongly tied to the simply-typed call-by-name lambda calculus and depends on finite sized base-types.  ... 
doi:10.1145/2661088.2661098 dblp:conf/dls/JohnsonH14 fatcat:jftogwomxjhs3ob62mihglncom

A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)

Francisco Rios, Peter Selinger
2018 Electronic Proceedings in Theoretical Computer Science  
Quipper is a practical programming language for describing families of quantum circuits. In this paper, we formalize a small, but useful fragment of Quipper called Proto-Quipper-M.  ...  We design Proto-Quipper-M from the ground up, by first giving a general categorical model of parameters and state.  ...  Most of the evaluation rules are those of a standard call-by-value lambda calculus. The rules that do all of the interesting "work" of Proto-Quipper-M are those for "box" and "apply".  ... 
doi:10.4204/eptcs.266.11 fatcat:mecmm3uhunh5nncitcnx6i4baa

Some Programming Languages Suggested by Game Models (Extended Abstract)

John Longley
2009 Electronical Notes in Theoretical Computer Science  
In each case, we present an extension of Plotkin's language FPC (or a suitable linearization thereof) which defines all computable strategies of appropriate types.  ...  The quest for such languages results in a novel selection of language primitives for state encapsulation, coroutining and backtracking.  ...  For example, one might prove that an interpretation [[ − ]] of a language L in a model M is fully abstract, or that all computable elements of M are definable by programs of L.  ... 
doi:10.1016/j.entcs.2009.07.087 fatcat:ayy7zyab6ndqrbmnkj6wkl4nlu

On the Ubiquity of Certain Total Type Structures(Extended Abstract)

J LONGLEY
2004 Electronical Notes in Theoretical Computer Science  
In each case, we present an extension of Plotkin's language FPC (or a suitable linearization thereof) which defines all computable strategies of appropriate types.  ...  The quest for such languages results in a novel selection of language primitives for state encapsulation, coroutining and backtracking.  ...  Thus, a call-by-value interpretation of FPC in Fam(G ! i ) works for i = 1, 3 but not for i = 2.  ... 
doi:10.1016/s1571-0661(04)05085-6 fatcat:gsykszwdmnaehmezpisla3btbq

Symbolic mathematics system evaluators (extended abstract)

Richard J. Fateman
1996 Proceedings of the 1996 international symposium on Symbolic and algebraic computation - ISSAC '96  
Evaluation" of expressions and programs in a computer algebra system is central to every system, but inevitably fails to provide complete satisfaction.  ...  We give examples primarily from Axiom, Macsyma, Maple, Mathematica, with passing mention of a few other systems.  ...  In simple cases, this model is intuitive for the user and efficiently implemented by a computer. But a system design must also handle cases that are not so simple or intuitive.  ... 
doi:10.1145/236869.236907 dblp:conf/issac/Fateman96 fatcat:bzwdnup5ifh6jjgzcfpsyffy5y

Optimal representations of polymorphic types with subtyping (Extended abstract) [chapter]

Alexander Aiken, Edward L. Wimmers, Jens Palsberg
1997 Lecture Notes in Computer Science  
We present an algorithm for simplifying quanti ed types in the presence of subtyping and prove it is sound and complete for non-recursive and recursive types. 4 The source code for the Illyria system and  ...  When used together, these two features induce equivalences that allow types to be simpli ed by eliminating quanti ed variables.  ...  Acknowledgements The authors would like to thank Martin Abadi for useful discussions about connections to the ideal model as well as the anonymous referees for their criticisms.  ... 
doi:10.1007/bfb0014547 fatcat:m3unkvrjhvd2rctuektuvrmjqq

A Lambda Calculus for Quantum Computation

André van Tonder
2004 SIAM journal on computing (Print)  
The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation.  ...  We set up a computational model and an equational proof system for this calculus, and we argue that it is equivalent to the quantum Turing machine.  ...  in figure 2. v ::= values: x variable (λx. t) abstraction value Values in the call-by-value calculus λ v , Figure 3 : 3 Reduction rules for the call-by-value calculus λ v Figure 4 : 4 Syntax of the  ... 
doi:10.1137/s0097539703432165 fatcat:w5qgqihfdbeajp4b6zkfwnpafa

Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus [chapter]

Masahito Hasegawa
2002 Lecture Notes in Computer Science  
We propose a semantic and syntactic framework for modelling linearly used effects, by giving the monadic transforms of the computational lambda calculus (considered as the core calculus of typed call-by-value  ...  As a technical result we show the full completeness of the CPS transform into the linear lambda calculus.  ...  Thanks also to anonymous reviewers for helpful comments. Part of this work was carried out while the author was visiting Laboratory for Foundations of Computer Science, University of Edinburgh.  ... 
doi:10.1007/3-540-45788-7_10 fatcat:yci7e6djxfa43amh2mdd5373ty

PhD Abstracts

GRAHAM HUTTON
2015 Journal of functional programming  
If a student or advisor would like to submit a dissertation abstract for publication in this series, please contact the editor for further details.  ...  The abstracts are made freely available on the JFP website, i.e. not behind any paywall, and do not require any transfer for copyright, merely a license from the author.  ...  Part III: The Krivine abstract machine is a mechanism for call-by-name evaluation of lambda terms (which has been extended by De Groote for lambda mu-calculus).  ... 
doi:10.1017/s0956796815000040 fatcat:g7yt23qxivevte45fkiqv6xwna

Presheaf Models of Quantum Computation: An Outline [chapter]

Octavio Malherbe, Philip Scott, Peter Selinger
2013 Lecture Notes in Computer Science  
We first give an abstract description of the properties required of the base categories for the model construction to work.  ...  We construct a concrete denotational semantics of Selinger and Valiron's quantum lambda calculus, which was previously an open problem.  ...  This research was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) and by the Program for the Development of Basic Sciences, Uruguay (PEDECIBA).  ... 
doi:10.1007/978-3-642-38164-5_13 fatcat:vphga3zfbfa35kyhrhziem7bzi

Call-by-name, call-by-value, call-by-need and the linear lambda calculus

J. Maraist, M. Odersky, D.N. Turner, P. Wadler
1999 Theoretical Computer Science  
Our results extend neatly to translations of extensions for recursion in the call-by-name and call-by-value calculi, and in general to extensions for products and for the corresponding untyped systems.  ...  We detail the action of these translations on terms and show that the ÿrst corresponds to a call-by-name calculus, while the second corresponds to call-by-value.  ...  and call-by-value into a similarly extended recursive linear calculus.  ... 
doi:10.1016/s0304-3975(98)00358-2 fatcat:wpm6kbycovabhlkibythzok3mu

From Linear Logic to Cyclic Sharing

Masahito Hasegawa
2019 Electronic Proceedings in Theoretical Computer Science  
We present a translation from Multiplicative Exponential Linear Logic to a simply-typed lambda calculus with cyclic sharing.  ...  It turns out that the translation is a mixture of the call-by-name CPS translation and the Geometry of Interaction-based interpretation.  ...  Acknowledgements I thank Ken Sakayori and Takeshi Tsukada for stimulating discussions related to this work.  ... 
doi:10.4204/eptcs.292.3 fatcat:cznwpsweuvfnrlguxy4dzdaepy
« Previous Showing results 1 — 15 out of 3,716 results