39 Hits in 3.3 sec

Liquidate your assets: reasoning about resource usage in liquid Haskell

Martin A. T. Handley, Niki Vazou, Graham Hutton
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
We use the system's existing verification machinery to ensure that the results of our cost analysis are valid, together with custom invariants for particular program contexts to ensure that the results  ...  Intrinsic Cost Analysis In the case of intrinsic cost analysis, the resources utilised by a function are declared inside the type signature of the function and are automatically checked by Liquid Haskell  ...  ACKNOWLEDGEMENTS We thank Rustan Leino for the discussion on the initial idea of our system and the anonymous reviewers for the useful comments and suggestions.  ... 
doi:10.1145/3371092 fatcat:uuvnojurevavvbjilyccyutlga

A cost-aware logical framework [article]

Yue Niu
2021 arXiv   pre-print
We present calf, a cost-aware logical framework for studying quantitative aspects of functional programs.  ...  As a full-spectrum dependent type theory, calf presents a unified language for programming and specification of both cost and behavior that can be integrated smoothly with existing mathematical libraries  ...  ACKNOWLEDGMENTS We are grateful to Carlo Angiuli and Alex Kavvos for productive discussions on the topic of this research, and to Tristan Nguyen at AFOSR for his support.  ... 
arXiv:2107.04663v2 fatcat:3bit6tz77ff65drvkyiid5zgne

Creative Research and Theory Building in Library and Information Sciences

Amusi Odi
1982 College and Research Libraries  
Does a library administrator who does not consult with his staff in a formal way, but whose decisions invariably reflect the interest of the staff, fail to practice participative management?  ...  it gives only one number as an aid towards understanding a complex relationship rather than the estimation of a mathematical function yielded by regression techniques; it demands more restrictive assumptions  ... 
doi:10.5860/crl_43_04_312 fatcat:4sglt7eiabc7vmg45gkqbg4ktu

A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification [chapter]

Armaël Guéneau, Arthur Charguéraud, François Pottier
2018 Lecture Notes in Computer Science  
We present a framework for simultaneously verifying the functional correctness and the worst-case asymptotic time complexity of higher-order imperative programs.  ...  We propose a way of integrating complexity bounds into specifications, present lemmas and tactics that support a natural reasoning style, and illustrate their use with a collection of examples.  ...  TiML [25] is a functional programming language where types carry time complexity annotations. Its type-checker generates proof obligations that are discharged by an SMT solver.  ... 
doi:10.1007/978-3-319-89884-1_19 fatcat:6hercwnspngkjddzf47upuhoue

Building-Blocks for Performance Oriented DSLs

Tiark Rompf, Arvind K. Sujeeth, HyoukJoong Lee, Kevin J. Brown, Hassan Chafi, Martin Odersky, Kunle Olukotun
2011 Electronic Proceedings in Theoretical Computer Science  
Implementing efficient DSL compilers is a daunting task however, and support for building performance-oriented DSLs is urgently needed.  ...  by making the compiler reason on a higher level.  ...  Acknowledgments The authors would like to thank the DSL'11 reviewers for their high-quality feedback and Jeremy Siek for shepherding this paper.  ... 
doi:10.4204/eptcs.66.5 fatcat:gcheesadifg6bdjcx27hbbtqem

Denotational recurrence extraction for amortized analysis [article]

Joseph W. Cutler, Daniel R. Licata, Norman Danner
2020 arXiv   pre-print
We give a recurrence extraction translation of this language into a recurrence language, a simply-typed lambda-calculus with a cost type, and state and prove a bounding logical relation expressing the  ...  A typical way of analyzing the time complexity of functional programs is to extract a recurrence expressing the running time of the program in terms of the size of its input, and then to solve the recurrence  ...  Two recent approaches that handle amortized analysis for functional programs are Timed ML (TiML, [39] ) and automatic amortized resource analysis (AARA, [14] [15] [16] 29] ).  ... 
arXiv:2006.15036v1 fatcat:ef4bqzhhrfc7vdtg5p5ubuj4x4

Synthesis with Asymptotic Resource Bounds [article]

Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas Reps
2021 arXiv   pre-print
Our method can synthesize programs with complex resource bounds, such as a sort function that has complexity O(nlog(n)).  ...  We present a method for synthesizing recursive functions that satisfy both a functional specification and an asymptotic resource bound.  ...  Supported, in part, by a gift from Rajiv and Ritu Batra; by multiple Facebook Research Awards; by a Microsoft Faculty Fellowship; by NSF under grants 1420866, 1763871, and 1750965; and by ONR under grants  ... 
arXiv:2103.04188v2 fatcat:q32grfvsl5egxmitaj5okaldl4

Fine-Tuning Data Structures for Analytical Query Processing [article]

Amir Shaikhha, Marios Kelepeshis, Mahdi Ghorbani
2021 arXiv   pre-print
This language is designed around the notion of dictionaries, and allows for a more fine-grained choice of its low-level implementation.  ...  Furthermore, we show that the performance of the code generated by our framework either outperforms or is on par with the state-of-the-art analytical query engines and a recent in-database machine learning  ...  Timl: a functional language for practical PVLDB, 4(9):539–550, 2011. complexity analysis with invariants.  ... 
arXiv:2112.13099v1 fatcat:nsusnsmfmjburlisefcbzp6ooy

Helix: Holistic Optimization for Accelerating Iterative Machine Learning [article]

Doris Xin, Stephen Macke, Litian Ma, Jialin Liu, Shuchen Song, Aditya Parameswaran
2018 arXiv   pre-print
Helix captures a wide variety of application needs within its Scala DSL, with succinct syntax defining unified processes for data preprocessing, model specification, and learning.  ...  We demonstrate that the reuse problem can be cast as a Max-Flow problem, while the caching problem is NP-Hard. We develop effective lightweight heuristics for the latter.  ...  This graph, for practical workflows, can be quite large and complex.  ... 
arXiv:1812.05762v1 fatcat:v4jrdttdq5aj3jngnvs3n27t4u

Liquid Resource Types [article]

Tristan Knoth, Di Wang, Adam Reynolds, Jan Hoffmann, Nadia Polikarpova
2020 arXiv   pre-print
This article presents liquid resource types, a technique for automatically verifying the resource consumption of functional programs.  ...  The type system augments refinement types with potential annotations to conduct an amortized resource analysis.  ...  A recent article also studied refinement types for a language with lazy evaluation [Handley et al. 2020 ].  ... 
arXiv:2006.16233v2 fatcat:cbyx5efg25crlgckf4vugli6fi

View Entire Issue

Editor, Robert M. Bernard
2009 Canadian Journal of Learning and Technology  
The complexities of expert systems are directly related to the complexities of problem solving strategies and cognitive functions in humans.  ...  Description, analysis, explanation and prediction of system behaviour using OR theories and procedures provides a scientific basis for solving problems involving a complex of interrelated entities.  ...  Support material varies from complex texts, to study guides, to programs alone. THE AFRICANS Information for Authors General Policies.  ... 
doi:10.21432/t27k69 fatcat:ojojusaamrfrrc2v4sjcsdkweq

Estimation of Critical Bandwidth Using Digitally Processed Speech

Robert Daniel Celmer
1983 Journal of the Acoustical Society of America  
Preliminary analysis with reference to the critical bandwidth phenomenon indicates that this mechanism seems to be working for speech analysis on a peripheral basis.  ...  A tonal complex with an initially sub-critical bandwidth is presented to a listener.  ...  Summary This research has been a true interdisciplinary endeavor, drawing from such schools of thought as engineering, physiology, physics, mathematics, and psychology.  ... 
doi:10.1121/1.388967 fatcat:kfakynjtdbc7ld75vmlhkfxypa

Octonary Numeration, and Its Application to a System of Weights and Measures

Alfred B. Taylor
1887 Proceedings of the American Philosophical Society  
The danger of error increases rapidly with the increasing complexity of the numeric [Taylor.  ...  Adams, after his unequaled analysis of the English system of measures, in view of its close agreement with ouLr own, discountenances all attempts at a premature innovation.  ... 

Reports of Sections and Societies

1961 Science  
It gives original descriptions of over 400 species belonging to 206 genera, and, with information from the literature, 345 genera are covered.  ...  RUGGED -The Shadograph is a precision instrument, sturdily constructed and designed for utmost dependability in day-in-day-out laboratory use.  ...  Models are available with visible sensitivity from one milligram (2000 milligrams capacity) to two grams (35 kilos capacity).  ... 
doi:10.1126/science.133.3451.482 pmid:17754436 fatcat:c5twnleb4ffdln3ydzi6mt2hce

Supplement 1300

1929 BMJ (Clinical Research Edition)  
If ever there was a subject tbat called for dispassionate study it is surely that concerned with the sexual instinct and the tumultuous and complex problems it involves.  ...  But, on the practical side, the reply is that there is no conceivable obiectioni to these processes being stated in physiological language if and wlhen a fuller kiiowledge renders this postibie; in the  ...  Ott the mlotion of Sir ALFRED RicE-OXLEY a vote of tlhanks was accorded with acclamation to Dr. Beadles for lhis duties as treasurer. Dr. L. G. GLOVER moved a lhearty vote of tlhanks to Dr.  ... 
doi:10.1136/bmj.1.3573.s249 fatcat:zwk3uraocvfofkrbbizq4jdg5a
« Previous Showing results 1 — 15 out of 39 results