2010
Abstract: Abstract. One of the applications of supercompilation is proving properties of programs. We focus in this paper on a specific task: proving term equivalence for a higher-order lazy functional language. The "classical" way to prove equivalence of two terms t1 and t2 is to write an equality function equals and to simplify the term (equals t1 t2). However, this works only when certain conditions are met. The paper presents another approach to proving term equivalence by means of supercompilation. In this approach…
Help me understand this reportSearch citation statements
Paper Sections
Select...
1
1
1
1
Citation Types
0
15
0
1
Year Published
2012
2015
Publication Types
Select...
2
Relationship
2
0
Authors
Journals
Cited by 13 publications
(16 citation statements)
References 16 publications
(11 reference statements)
0
15
0
1
“…Let us consider the example in Figure 1 illustrating the use of TT Lite SC for proving the equivalence of two expressions [7].…”
Section: Tt Lite Sc In Actionmentioning
confidence: 99%
“…Let us consider the example in Figure 1 illustrating the use of TT Lite SC for proving the equivalence of two expressions [7].…”
Section: Tt Lite Sc In Actionmentioning
confidence: 99%
“…Examples of using supercompilation for the purposes of analysis and verification are: verification of protocols [5,6], proving the equivalence of programs [7], contract checking (e.g. the verification of monadic laws) [8], problem solving in Prolog style by inverse computation [9], proving the correctness of optimizations (verifying improvement lemmas) [10], proving the productivity of corecursive functions [11].…”
Section: Introductionmentioning
confidence: 99%
“…In this case an instance of a supercompiler, essentially, controls the execution of another instance of the same supercompiler. -Proving the equivalence of expressions by supercompilation [18,16]. In this case supercompilation is used as a means of normalizing programs for further check for syntactic isomorphism.…”
Section: Diversity Of Higher-level Supercompilationmentioning
confidence: 99%
“…In some cases of higher-level supercompilation, such as self-application [2,21] and the simplest two-level supercompilation [16,17], there is a single (and fixed) supercompiler under control. However, this straightforward approach is unable to take advantage of the real potential of metasystem transition, because any real control implies the possibility of choice, which does not exist without some variety and/or multiplicity at the lower level.…”
Section: Branching Growth Of the Penultimate Level In Metasystem Tranmentioning
confidence: 99%
scite is a Brooklyn-based startup that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.