Skip to main content

Search

Show all results for

Home

Publication

Contract-Based Resource Verification for Higher-Order Functions with Memoization

About
Privacy
Disclaimer

Copyright © 2025 EPFL, all rights reserved

Graph Chatbot

Viktor Kuncak, Ravichandhran Kandhadai Madhavan, Sumith Kulal
2017

Abstract

We present a new approach for specifying and verifying resource utilization of higher-order functional programs that use lazy evaluation and memoization. In our approach, users can specify the desired resource bound as templates with numerical holes e.g. as steps

Official source

https://infoscience.epfl.ch/entities/publication/c9d0caf0-2b2e-46fe-880d-e971ecc4c1ea

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (27)

Related concepts (32)

Higher-order function

In mathematics and computer science, a higher-order function (HOF) is a function that does at least one of the following: takes one or more functions as arguments (i.e. a procedural parameter, which is a parameter of a procedure that is itself a procedure), returns a function as its result. All other functions are first-order functions. In mathematics higher-order functions are also termed operators or functionals. The differential operator in calculus is a common example, since it maps a function to its derivative, also a function.

Lazy evaluation

In programming language theory, lazy evaluation, or call-by-need, is an evaluation strategy which delays the evaluation of an expression until its value is needed (non-strict evaluation) and which also avoids repeated evaluations (by the use of sharing). The benefits of lazy evaluation include: The ability to define control flow (structures) as abstractions instead of primitives. The ability to define potentially infinite data structures. This allows for more straightforward implementation of some algorithms.

Scala (programming language)

Scala (ˈskɑːlə ) is a strong statically typed high-level general-purpose programming language that supports both object-oriented programming and functional programming. Designed to be concise, many of Scala's design decisions are aimed to address criticisms of Java. Scala source code can be compiled to Java bytecode and run on a Java virtual machine (JVM). Scala can also be compiled to JavaScript to run in a browser, or directly to a native executable.

The autism susceptibility kinase, TAOK2, phosphorylates eEF2 and modulates translation

Nagammal Neelagandan

Genes implicated in translation control have been associated with autism spectrum disorders (ASDs). However, some important genetic causes of autism, including the 16p11.2 microdeletion, bear no obvious connection to translation. Here, we use proteomics, g ...

Amer Assoc Advancement Science2024

Two-particle Bose-Einstein correlations and their Lévy parameters in PbPb collisions at √sNN=5.02 TeV

Matthias Finger, Konstantin Androsov, Qian Wang, Jan Steggemann, Yiming Li, Anna Mascellani, Varun Sharma, Xin Chen, Rakesh Chawla, Matteo Galli

Two -particle Bose-Einstein momentum correlation functions are studied for charged-hadron pairs in lead -lead collisions at a center -of -mass energy per nucleon pair of .'/sNN = 5.02 TeV. The data sample, containing 4.27 x 109 minimum bias events correspo ...

Amer Physical Soc2024

Acceleration of graph pattern mining and applications to financial crime

Various forms of real-world data, such as social, financial, and biological networks, can be represented using graphs. An efficient method of analysing this type of data is to extract subgraph patterns, such as cliques, cycles, and motifs, from graphs. For ...

EPFL2023

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages