Filters








11,330 Hits in 5.3 sec

Duality between Call-by-Name Recursion and Call-by-Value Iteration [chapter]

Yoshihiko Kakutani
2002 Lecture Notes in Computer Science  
We investigate the duality between call-by-name recursion and call-by-value iteration in the λµ-calculi and their models. Semantically, we consider that iteration is the dual notion of recursion.  ...  By the duality between values and continuations, we can get recursion on continuations in call-by-value languages from call-by-name recursion.  ...  Acknowledgment I wish to thank Masahito Hasegawa for supervising this work, and thank anonymous referees for helpful suggestions.  ... 
doi:10.1007/3-540-45793-3_34 fatcat:dkom6o4wxzbm7iq5b4p4fhkrp4

Axioms for Recursion in Call-by-Value [chapter]

Masahito Hasegawa, Yoshihiko Kakutani
2001 Lecture Notes in Computer Science  
We propose an axiomatization of fixpoint operators in typed call-by-value programming languages, and give its justifications in two ways.  ...  First, it is shown to be sound and complete for the notion of uniform T -fixpoint operators of Simpson and Plotkin.  ...  We thank Shin-ya Katsumata for helpful discussions, and the anonymous reviewers for numerous suggestions.  ... 
doi:10.1007/3-540-45315-6_16 fatcat:hltwyeuoavflnitdisgpg7n2bu

Page 10248 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
) Duality between call-by-name recursion and call-by-value iteration.  ...  Sci., 4 2471, Springer, Berlin, 2002. ; Summary: “We investigate the duality between call-by-name recur- sion and call-by-value iteration in the “-calculi and their models.  ... 

Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing

Petr Kolman, Christian Scheideler
2013 Theory of Computing Systems  
An elementary h-route flow, for an integer h ≥ 1, is a set of h edge-disjoint paths between a source and a sink, each path carrying a unit of flow, and an h-route flow is a non-negative linear combination  ...  The main result of this paper is an approximate duality theorem for multicommodity h-route cuts and flows, for h ≤ 3: The size of a minimum h-route cut is at least f /h and at most O(log 3 k ·f ) where  ...  The first author would like to thank Jiří Sgall and Thomas Erlebach for stimulating discussions.  ... 
doi:10.1007/s00224-013-9454-3 fatcat:vjlestmhavezhmuumfcb5bw6uy

Sort vs. hash revisited

G. Graefe, A. Linville, L.D. Shapiro
1994 IEEE Transactions on Knowledge and Data Engineering  
In this article, we compare the concepts behind sort-and hash-based queryprocessing algorithms and conclude that 1) many dualities exist between the two types of algorithms, 2) their costs differ mostly  ...  by percentages rather than factors, 3) several special cases exist that favor one or the other choice, and 4) there is a strong reason why both hash-and sort-based algorithms should be available in a  ...  Finally, the close call recursively "shuts down" all iterators in the query.  ... 
doi:10.1109/69.334883 fatcat:ddxhl4i56zczdfrh4njk2oic6e

Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions

Qi Zhou, David Heath, William Harris
2018 Electronic Proceedings in Theoretical Computer Science  
Recursion-free Constrained Horn Clauses (CHCs) are logic-programming problems that can model safety properties of programs with bounded iteration and recursion.  ...  We implemented a CHC solver named Shara. Shara solves arbitrary CHC systems by reducing the input to a series of CDD systems.  ...  We modified the algorithm used by DUALITY to generate recursion-free unwindings of a given recursive system so that, in each iteration, it generates an unwinding which is converted to CDD form.  ... 
doi:10.4204/eptcs.278.3 fatcat:hvc5oimwqvgezd2ssmmvzcbkrq

Talking bananas: structural recursion for session types

Sam Lindley, J. Garrett Morris
2016 SIGPLAN notices  
Finally, we extend CP, a session-typed process calculus based on linear logic, with recursive types, and show that doing so preserves the connection between reduction in GV and cut elimination in CP.  ...  We show that this principled approach to recursion resolves long-standing problems in the treatment of duality for recursive session types.  ...  Thanks to Giovanni Bernardi, Ornela Dardha, Simon Fowler, Philip Wadler, and the anonymous referees for helpful feedback. This work was funded by EPSRC grant number EP/K034413/1.  ... 
doi:10.1145/3022670.2951921 fatcat:su5ub5ycobdwdewal5ypif7pia

Talking bananas: structural recursion for session types

Sam Lindley, J. Garrett Morris
2016 Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming - ICFP 2016  
Finally, we extend CP, a session-typed process calculus based on linear logic, with recursive types, and show that doing so preserves the connection between reduction in GV and cut elimination in CP.  ...  We show that this principled approach to recursion resolves long-standing problems in the treatment of duality for recursive session types.  ...  Thanks to Giovanni Bernardi, Ornela Dardha, Simon Fowler, Philip Wadler, and the anonymous referees for helpful feedback. This work was funded by EPSRC grant number EP/K034413/1.  ... 
doi:10.1145/2951913.2951921 dblp:conf/icfp/LindleyM16 fatcat:u5kserqmszebhfig7fjccimyma

Some Remarks on Type Systems for Course-of-value Recursion

Favio Ezequiel Miranda-Perea
2009 Electronical Notes in Theoretical Computer Science  
Course-of-value recursion is a scheme which allows us to define the value of a function in some argument of an inductive structure by using not only the immediate, but arbitrary previously computed values  ...  On the other hand, it is known that other categorical principles such as catamorphisms and anamorphisms representing definitions by iteration and coiteration have been successfully used to implement safe  ...  Acknowledgement We are thankful to our anonymous referees for the helpful comments and suggestions regarding the contents and presentation of this paper.  ... 
doi:10.1016/j.entcs.2009.07.051 fatcat:3qfhkchmmfd5vlpyz2lzqcd73e

Fluent Session Programming in C#

Shunsuke Kimura, Keigo Imai
2020 Electronic Proceedings in Theoretical Computer Science  
The key features are (1) the improved fluent interface which enables writing communication in chained method calls, by exploiting C#'s out variables, and (2) amalgamation of session delegation with async  ...  /await, which materialises session cancellation in a limited form, which we call session intervention.  ...  This work is partially supported by KAKENHI 17K12662 from JSPS, Japan, and by Grantsin-aid for Promotion of Regional Industry-University-Government Collaboration from Cabinet Office, Japan.  ... 
doi:10.4204/eptcs.314.6 fatcat:hybulxzjmbahtlewtvh6fpydjy

A Multipurpose Backtracking Algorithm

H.A. Priestley, M.P. Ward
1994 Journal of symbolic computation  
A backtracking algorithm with element order selection is presented, and its efficiency discussed in relation both to standard examples and to examples concerning relation-preserving maps which the algorithm  ...  First, note that we can replace the parameter p by a global variable because we can restore its value and the value of t after a recursive call by doing t last ←− p.  ...  Execution of the statements S jk also has to be postponed (since they occur between recursive calls), we record the postponement of S jk by pushing j, k , x onto L.  ... 
doi:10.1006/jsco.1994.1035 fatcat:jwgkd6k7nbgb7jqfpnmffea2zi

Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types

Daisuke Kimura, Makoto Tatsuta, Philip Wadler
2013 Logical Methods in Computer Science  
This paper then introduces a call-by-value system and a call-by-name system of the dual calculus with inductive and coinductive types, and shows the duality of call-by-value and call-by-name, their Church-Rosser  ...  Besides the same duality of the original dual calculus, it has the duality of inductive and coinductive types, that is, the duality of terms and coterms for inductive and coinductive types, and the duality  ...  Acknowledgment We would like to thank Professor Philip Wadler for discussions and suggestions. We would also like to thank Dr. Alwen Tiu, and Professor Dieter Spreen for discussions.  ... 
doi:10.2168/lmcs-9(1:14)2013 fatcat:kzfw3meq6vaj5nki6viu3w3nxy

Designing secure communication protocols from trust specifications [chapter]

Christos H. Papadimitriou, Venkat Rangan, Martha Sideri
1991 Lecture Notes in Computer Science  
network and the trust relationship between the nodes.  ...  We formulate the problem of designing a secure communication protocol, given a network interconnection and a ternary relation which captures trust between the entities.  ...  This is true for all channel synthesis methods (recursive, and by the Duality Theorem iterative, path, or completely unrestricted).  ... 
doi:10.1007/3-540-54967-6_81 fatcat:3r2ne67tkfhbndjnuzdm7dclym

Designing secure communication protocols from trust specifications

C. H. Papadimitriou, V. Rangan, M. Sideri
1994 Algorithmica  
network and the trust relationship between the nodes.  ...  We formulate the problem of designing a secure communication protocol, given a network interconnection and a ternary relation which captures trust between the entities.  ...  This is true for all channel synthesis methods (recursive, and by the Duality Theorem iterative, path, or completely unrestricted).  ... 
doi:10.1007/bf01293268 fatcat:7w6l6eea7zesfnt3h7jutnjnvm

On correlation between the order of S-boxes and the strength of DES [chapter]

Mitsuru Matsui
1995 Lecture Notes in Computer Science  
Its principle is based on a duality between differential cryptanalysis and linear cryptanalysis, and applicable to various block ciphers.  ...  In other words, DES can be strengthened by just rearranging the order of the S-boxes.  ...  between differential cryptanalysis and linear cryptanalysis from the viewpoint of duality.  ... 
doi:10.1007/bfb0053451 fatcat:izgoj3llnndctjpjkebj5p7gve
« Previous Showing results 1 — 15 out of 11,330 results