Termination Checking Nested Inductive and ... - Semantic Scholar
Recommend Documents
pression of transaction control (nested transactions, long transactions, coupling ... end of the transaction when all the required informa- tion is available. ... Execution of a method m is considered as consistent ... We want to express the followin
encodings for the Dutch word tafel (`table') is given in Table III. The column .... Aha, D. W., D. Kibler, and M. Albert: 1991, `Instance-based learning algorithms'.
HRRs provide an implementation of Hinton's [1990] âreduced ... PhD program, and thanks also to Canada for the education and for being a great place to live.
Abstract. First-order logic with k-ary deterministic transitive closure has the same power as two-way k-head deterministic automata that use a finite set of nested ...
An inductive logic is a system for reasoning that derives conclusions which are ...... an uncertain choice (e.g., a lottery ticket; or more generally, any action whose ...... [McKenzie and Mikkelsen, 2000] C. R. M. McKenzie and L. A. Mikkelsen.
Estlin and Mooney, 1996] Tara A. Estlin and Ray- mond Mooney. Hybrid learning of search control for partial-order planning. In New Directions in AI. Planning ...
Nov 26, 2010 - Archaea of the genus Sulfolobus have a single-circular chromosome with three ... have a bacterial-like mode of chromosome replication, with a.
a logic-based learning technique that is able to exploit domain knowledge. The paper is .... that an agent will get when starting in a state st and following a given policy . ..... Cheap on-the- y learning, o -line computationally expensive learning.
At the highest developmental level normally seen in college stu- dents (termed ... the subject, use of teaching methods that foster active and long- term engagement with .... teristic oà Just-in-Time Teaching, another inductive tech- nique to be ...
been studied by Rosca and Ballard 3], where two criterion were studied: t blocks and frequent blocks. They concluded that t blocks were the most useful ...
http://www.cs.ubc.ca/~poole/. Abstract. Building on advances in statistical-relational AI and the Se- mantic Web, this talk outlined how to create knowledge, how ...
Engineering and science are traditionally taught deductively. The instructor .... Instruction should require students to fiU in gaps and ex- trapolate material .... At the highest developmental level normally seen in college stu- dents (termed .....
Microsoft Center for Software .... We call this âactiveâ checking because a constraint .... call such a traditional runtime checker for concrete values a passive.
Since the input to black box checking is not given initially, as is the case in the classical model of computation, but is learned through experiments, we propose a ...
named Business Process Compliance Language (BPCL). BPCL models are still precise yet deliberately too abstract for being executable. Within a BPCL model, ...
require prior knowledge of the domain of the model variables. (boundedness ... a benchmark suite can be found on our website http://www-dssz.informatik.tu-.
consistency checking per node than other more com- plicated arc consistency algorithms 3, 7]. However, FC may not be e cient for problems with larger domain.
the tableau of ' in GL94]) such that a module M satis es ' precisely when M simulates M' (we de .... often and visits Bi only nitely often. We say that a fair ..... was shown in GL94] that the maximal-model technique yields a solution to the modular
Electrical Engineering and Computer Sciences, UC Berkeley. {tah,jhala,rupak .... (XP) [7] has been advocated as a new software-engineering paradigm with a.
Nov 11, 1994 - 1Department of Computer Sciences, The University of Texas at Austin, USA. ...... on Logics of Programs, Yorktown Heights, D. Kozen, editor, ...
argue that the correlation follows from the fact that in participle agreement ... double checking is at the source of clitic omission, following Wexler's (1998,.
jointly with Margaret Smith and greatly benefited from the collaboration with Ken ... [HS00] G.J. Holzmann, and M.H. Smith, Automating software feature ...
tomer computer with a third party processor computer that is linked with a merchant computer, and .... periments have been conducted on a laptop with an Intel. Core2Duo at 2.40 GHz as ... process-level: The ebay/amazon/paypal case study,â.
That is, our approach to Semantic Web search can perhaps be best realized ..... The experiments have been performed on a standard laptop (ASUS PRO31 ...
Termination Checking Nested Inductive and ... - Semantic Scholar
extension of a termination checker for a language with inductive types. However, this simplicity comes at a price: only types of the form νX.µY. .... Then, for every type, limit the semantic domain to a total subset of the corresponding CPO, in such.
Termination Checking Nested Inductive and Coinductive Types Thorsten Altenkirch and Nils Anders Danielsson University of Nottingham Abstract In the dependently typed functional programming language Agda one can easily mix induction and coinduction. The implementation of the termination/productivity checker is based on a simple extension of a termination checker for a language with inductive types. However, this simplicity comes at a price: only types of the form νX.µY.F X Y can be handled directly, not types of the form µY.νX.F X Y. We explain the implementation of the termination checker and the ensuing problem.
1
Introduction
This short and speculative note discusses how one can—apparently—extend a termination checker which accepts structurally recursive programs so that it also accepts guarded corecursive programs (and proofs) and even mixed recursive/corecursive definitions. However, we will also point out a problem with the extended checker: the “obvious” way to represent a coinductive type nested within an inductive type does not work. Some familiarity with total, dependently typed languages, induction, coinduction, structural recursion and guarded corecursion is assumed.
2
foetus
Originally the termination checker of the dependently typed functional programming language Agda (Norell 2007; Agda Team 2010) only supported structural recursion. The checker was based on foetus (Abel and Altenkirch 2002), which will now be explained using the following two, mutually recursive (and contrived) functions: mutual f : N→N→N f m zero = m f m (suc n) = f m n + g m g : N→N g zero = zero g (suc n) = f n n The definitions of f and g are accepted by foetus, which works roughly as follows: • For every function clause f p1 . . . pm and every call site g e1 . . . en in the right-hand side of the clause, the following information is noted for every pattern-argument pair (pi , e j ): Is e j structurally strictly smaller than pi , or is it equal to pi ? The former case is denoted by
