A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Program Extraction from Nested Definitions
[chapter]

2013
*
Lecture Notes in Computer Science
*

Minlog is a proof assistant which automatically

doi:10.1007/978-3-642-39634-2_27
fatcat:pd3cksivondwjfryiw36c4byiq
*extracts*computational content in an extension of Gödel's T*from*formalized proofs. ... In order to increase the efficiency of the*extracted**programs*, we have also implemented a feature to translate terms into Haskell*programs*. ... Berger [3] studies*program**extraction*and its application to exact real arithmetic. He manually*extracts**programs**from*proofs dealing with uniformly continuous functions. ...##
###
Recursive Program Optimization Through Inductive Synthesis Proof Transformation

1999
*
Journal of automated reasoning
*

The research described in this paper involved developing transformation techniques which increase the efficiency of the noriginal

doi:10.1023/a:1005969312327
dblp:journals/jar/MaddenBS99
fatcat:bfa4t4khaje2donwrokh4u7yc4
*program*, the source, by transforming its synthesis proof into one, the ... We describe a working proof transformation system which, by exploiting the duality between mathematical induction and recursion, employs the novel strategy of optimizing recursive*programs*by transforming ... Thus,*extract**programs*are correct with respect to the complete specifications of the synthesis proofs*from*which they are*extracted*. ...##
###
Transforming high-level data-parallel programs into vector operations

1993
*
Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPOPP '93
*

Thus these languages are not parallel

doi:10.1145/155332.155345
dblp:conf/ppopp/PrinsP93
fatcat:gnunajtjcnahfhddeacecsk7ma
*programming*languages. ... A major step in this direction was developed in [Blel90] where it was shown that for*nested*sequence aggregates subject to a restricted set of operations, an equivalent vector model*program*operating on ... Table i ← [1..5]: sqs(i)] with the*definition*for sqs*from*section 2. sqs(n) = [i ← [1..n]: i*i] 1. ...##
###
Functional pearl: getting a quick fix on comonads

2015
*
SIGPLAN notices
*

A piece of functional

doi:10.1145/2887747.2804310
fatcat:iuxkqhvxnvdgnp4q4j5dmeznd4
*programming*folklore due to Piponi provides Löb's theorem*from*modal provability logic with a computational interpretation as an unusual fixed point. ... Its computational interpretation permits the*definition*of a novel fixed point function allowing each part of a structure to refer to its own context within the whole. ... must be derived in part*from**extract*. ...##
###
Research on Integration Algorithm of Global Function Call Path Based on Module Path

2016
*
International Journal of Signal Processing, Image Processing and Pattern Recognition
*

analysis the local function call information, starting

doi:10.14257/ijsip.2016.9.6.12
fatcat:shu22wvutzcknj4qjf4ummtlr4
*from*the main function, expanse the function call information layer by layer, and then get the global function call relationship of the*program*. ... Paper proposed that for the single function of C*program*, analysis and*extraction*the control flow graph and local function call information stored on a particular data structure, design a algorithm to ... Function Call Relation Expansion Graph Figure 10 . 10 Global Function Call Path*Extraction**from*Sequential and Selection*Nested**Program*. ...##
###
Evolution of data models
[chapter]

1990
*
Lecture Notes in Computer Science
*

Specifically, we describe a first evolutionary path

doi:10.1007/3-540-53397-4_35
fatcat:qiebdruvnvgotjkjmpr57aohp4
*from*relations through*nested*relations and complex objects to object networks. ... While such mechanisms facilitate the*definition*of new types and gives rise to inheritance of attributes, methods, or functions, making query formulation easier, they also need new constructs in queries ... If we write these type*definitions*down in a linear syntax, like it is usually done in*programming*languages, see also [Seh77], then we might obtain for a sample*nested*relation Dept (dno,name,budget, ...##
###
Analysis of Polymorphically Typed Logic Programs Using ACI-Unification
[chapter]

2001
*
Lecture Notes in Computer Science
*

To formalise which properties of terms we want to characterise, we use labelling functions, which are functions that

doi:10.1007/3-540-45653-8_19
fatcat:x2ee6awnajh4xoiyzdpq3nwtle
*extract*subterms*from*a term along certain paths. ... This approach worked for polymorphically typed logic*programs*. Here, we recast this approach following [5, 11] . ... ., in (5) , we*extract*the only element*from*a list; coincidentally, this element is a*nest*. In (1) , we*extract*all*nests**from*a list of*nests*, thus including e(7). ...##
###
TRACO: An Automatic Loop Nest Parallelizer for Numerical Applications

2015
*
Proceedings of the 2015 Federated Conference on Computer Science and Information Systems
*

We present the source-to-source TRACO compiler allowing for increasing

doi:10.15439/2015f34
dblp:conf/fedcsis/PalkowskiKB15
fatcat:f2paanfzxnd4tksbthc7zoamci
*program*locality and parallelizing arbitrarily*nested*loop sequences in numerical applications. ... We consider benchmarks, typical*from*compute-intensive sequences of algebra operations or numerical computation*from*industry and engineering. ...*Definition*1. ...##
###
Variable granularity for improving precision of impact analysis

2009
*
2009 IEEE 17th International Conference on Program Comprehension
*

Impact analysis is a specialized process of

doi:10.1109/icpc.2009.5090023
dblp:conf/iwpc/PetrenkoR09
fatcat:5x3yufqbtvgxhhkbki255r4m2a
*program*comprehension that investigates the nature and extent of a planned software change. ... A component y in*program*P has*nesting*level*nest*(y) = k if there is a component z in P such that*nest*(z) = k-1 and the*definition*of x is*nested*in the*definition*of y. ...*Definition*4 . 4 A component x has*nesting*level*nest*(x) = 0 if its*definition*is not present within the*definition*of any other component in P. ...##
###
Analysis of Polymorphically Typed Logic Programs Using ACI-Unification
[article]

2001
*
arXiv
*
pre-print

To formalise which properties of terms we want to characterise, we use labelling functions, which are functions that

arXiv:cs/0105007v1
fatcat:22hfemiprvhklldoaqol77vtu4
*extract*subterms*from*a term along certain paths. ... This approach worked for polymorphically typed*programs*as in Goedel or HAL. Here, we recast this approach following works by Codish, Lagoon and Stuckey. ... The*extraction*axiom for*nest*(V) and list(*nest*(V)) is*nest*A (x 1 , list A (y) ⊕ x 2 ) =*nest*A (x 1 , x 2 ) ⊕ y. ...##
###
Source Code Verification for Embedded Systems using Prolog

2017
*
Electronic Proceedings in Theoretical Computer Science
*

A common technique to verify

doi:10.4204/eptcs.234.7
fatcat:pn3fcl7xqbgo5jati2koabmcii
*programs*is the analysis of their abstract syntax tree (AST). Tree structures can be elegantly analyzed with the logic*programming*language Prolog. ... On the other hand, Prolog's non-determinism and backtracking eases tests of different variations of the*program*flow without big effort. ... To*extract*the AST*from*the source code the converter uses Clang, a C/C++ front end for LLVM 2 . ...##
###
Possibilistic Nested Logic Programs

2012
*
International Conference on Logic Programming
*

The expressiveness of the possibilistic

doi:10.4230/lipics.iclp.2012.267
dblp:conf/iclp/NievesL12
fatcat:qgmstiewvzanrcom2m7pxu7le4
*nested*logic*programs*is illustrated by scenarios*from*the medical domain. ... We introduce the class of possibilistic*nested*logic*programs*. These possibilistic logic*programs*allow us to use*nested*expressions in the bodies and the heads of their rules. ... Hence, the following*definition*follows*from*the answer set*definition*.*Definition*6. [10] Let P be a*nested*logic*program*and M be a set of literals. ...##
###
Tuples Extraction from HTML Using Logic Wrappers and Inductive Logic Programming
[chapter]

2005
*
Lecture Notes in Computer Science
*

This paper presents an approach for applying inductive logic

doi:10.1007/11495772_8
fatcat:ydaystgponbpbi6cmyd5addvsq
*programming*to information*extraction**from*HTML documents structured as unranked ordered trees. ... We consider information*extraction**from*Web resources that are abstracted as providing sets of tuples. ...*Definition*1 . 1 (L-wrapper) An L-wrapper is a logic*program*defining a relation*extract*(N 1 , . . . , N k ) ⊆ N ×. . .×N . ...##
###
Partial and Nested Recursive Function Definitions in Higher-order Logic

2009
*
Journal of automated reasoning
*

It turns out that this modularity also facilitates termination arguments for total functions, in particular for

doi:10.1007/s10817-009-9157-2
fatcat:etpmyhp3c5hmlfs3nqd7q2m76u
*nested*recursions. ... Based on inductive*definitions*, we develop a tool that automates the*definition*of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for reasoning about them. ... zero We now define the*nested*zero function*from*§1.1.2. ...##
###
Aspect mining in the presence of the C preprocessor

2008
*
Proceedings of the 2008 AOSD workshop on Linking aspect technology and evolution - LATE '08
*

In this paper, we explore the process of aspect mining and

doi:10.1145/1404953.1404954
dblp:conf/aosd/AdamsRGC08
fatcat:th7yztvc2fckzcugrro7zozpbi
*extraction*in the context of preprocessor-driven systems. ... Our aim is to identify both opportunities (*extracting*conditional compilation into advice) and pitfalls (mining on unpreprocessed code) in migrating preprocessor code to aspects. ... Acknowledgements Bram Adams is supported by a BOF grant*from*Ghent University. ...
« Previous

*Showing results 1 — 15 out of 86,175 results*