Filters








414 Hits in 2.8 sec

Synthesizing Least Fixed Point Queries Into Non-Recursive Iterative Programs

Shamim A. Naqvi, Lawrence J. Henschen
1983 International Joint Conference on Artificial Intelligence  
An algorithm is presented which takes a least fixed point query expressed by a basis and inductive step and transforms it into a non-recursive iterative program.  ...  By augmenting a relational system with this algorithm, least fixed point queries can be handled automatically, and there is no need to proceduralizc relational algebra for such queries.  ...  The use of this method permits one to process LFP queries posed in a conventional relational calculus.  ... 
dblp:conf/ijcai/NaqviH83 fatcat:bka5ofog6vegpko4twju22i5bu

Mtac2: typed tactics for backward reasoning in Coq

Jan-Oliver Kaiser, Beta Ziliani, Robbert Krebbers, Yann Régis-Gianas, Derek Dreyer
2018 Proceedings of the ACM on Programming Languages  
In this paper, we present Mtac2, a next-generation version of Mtac that combines its support for typed metaprogramming with additional support for the programming of backward-reasoning tactics in the style  ...  Unfortunately, though, these tactic languages share a significant weakness.  ...  ; Matthieu Sozeau, for his invaluable help with the Coq API; Emilio Jesús Gallego Arias, for helping port Mtac2 to recent versions of Coq; and Jason Gross, for giving us the opportunity to test and improve  ... 
doi:10.1145/3236773 dblp:journals/pacmpl/KaiserZKRD18 fatcat:bu3in6clhrftzbkl27pvj5ydse

The Coq Proof Assistant, Version 8.7.1 [article]

The Coq Development Team
2017 Zenodo  
Coq 8.7 includes: A large amount of work on cleaning and speeding up the code base, notably the work of Pierre-Marie Pédrot on making the tactic-level system insensitive to existential variable expansion  ...  Version 8.7.1 brings compatibility with OCaml 4.06.0, many bug fixes, documentation improvements, and user message improvements.  ...  This is such a frequent way of reasoning that SSREFLECT has a variant of the have tactic called suffices (whose abridged name is suff).  ... 
doi:10.5281/zenodo.1133970 fatcat:r426i2vxujfqviuefbs5ytsnfu

The Coq Proof Assistant, Version 8.7.2 [article]

The Coq Development Team
2018 Zenodo  
Version 8.7.2 fixes a critical bug in the VM handling of universes. This bug affected all releases since 8.5.  ...  Coq 8.7 includes: A large amount of work on cleaning and speeding up the code base, notably the work of Pierre-Marie Pédrot on making the tactic-level system insensitive to existential variable expansion  ...  This is such a frequent way of reasoning that SSREFLECT has a variant of the have tactic called suffices (whose abridged name is suff).  ... 
doi:10.5281/zenodo.1174360 fatcat:ewr4sjw56bep7ej7j34qmpm74i

Transforming the lecture-hall environment: The fully interactive physics lecture

David E. Meltzer, Kandiah Manivannan
2002 American Journal of Physics  
We report on seven years of development and testing of a variant of Peer Instruction as pioneered by Mazur that aims at achieving virtually continuous instructorstudent interaction through a "fully interactive  ...  We also discuss a variety of assessment data that indicate strong gains in student learning, consistent with other researchers.  ...  Since 1997, an abridged version of the CSE has been administered on both the first and last days of class.  ... 
doi:10.1119/1.1463739 fatcat:nlnwwgm7kngbde2m7xvgbmphfm

Dependent interoperability

Peter-Michael Osera, Vilhelm Sjöberg, Steve Zdancewic
2012 Proceedings of the sixth workshop on Programming languages meets program verification - PLPV '12  
We present a core calculus called SD, which combines dependently-and simply-typed sublanguages and supports user-defined (dependent) datatypes, among other standard features.  ...  The operational semantics of SD demonstrates how the necessary dynamic checks, which must be done when passing a value from the simply-typed world to the dependently typed world, can be extracted from  ...  Coq's Program Tactic Coq's Program tactic [28] offers a different flavor of interoperability than Extraction.  ... 
doi:10.1145/2103776.2103779 dblp:conf/plpv/OseraSZ12 fatcat:ydzcp6r6p5bkllma2iavk5yoc4

Modeling Human Actions through Context

Avelino J. Gonzalez
2017 Modélisation et utilisation du contexte  
Two points of view are discussed vis-à-vis the tactical behavior of an agent: a) from the point of view of a performer of an action (the doer), and b) from the standpoint of one who directs others (agents  ...  The discussion centers about the work done in the author's research laboratory that addresses tactical behavior by an agent. A limited discussion about the works of others is also included.  ...  In their work, the authors built a CxBR system that reflected the expertise of a battalion commander on a (simulated) military mission.  ... 
doi:10.21494/iste.op.2017.0147 fatcat:pfmwndma4rhkjjcrl4hteoutkq

Book Reviews

Redactie KITLV
1989 NWIG  
An abridged paperback version is in preparation, and it will be interesting to see what is left out.  ...  The text from which the current editor made his own abridgment already represented a "doublé translation/ abridgment" of Stedman's book, with textual cuts motivated in part by political concerns in Paris  ... 
doi:10.1163/13822373-90002032 fatcat:gqvzpaj2hzfojmmlzhaz7rq63a

Foreign influence and the mathematics education at the Spanish College of Artillery (1764-1842)

Juan Navarro Loidi
2020 Philosophia Scientiæ  
Le but de cet article est d'étudier l'enseignement des mathématiques au Collège d'Artillerie espagnol de 1764 à 1842, et de repérer les influences étrangères sur elle.  ...  After some debate, a new abridged program was proposed in 1837. Calculus was removed altogether from the curriculum, and required coursework in mechanics was reduced from one year to six months.  ...  The fourth volume is on calculus and has three parts, two long sections on differential and integral calculus and a shorter section on calculus of variations.  ... 
doi:10.4000/philosophiascientiae.2192 fatcat:ln6o6l3x6zc7jkl6hwhbjukym4

Roles, stacks, histories: A triple for Hoare

JOHANNES BORGSTRÖM, ANDREW D. GORDON, RICCARDO PUCELLA
2010 Journal of functional programming  
The theoretical foundation for F7 and its type system is RCF, which is the standard Fixpoint Calculus (FPC, a typed call-by-value λ-calculus with sums, pairs, and iso-recursive types) (Plotkin 1985; Gunter  ...  The appendices include the direct encoding of our calculus RIF within the existing calculus RCF.  ...  Roles, stacks, histories: A triple for Hoare  ... 
doi:10.1017/s0956796810000134 fatcat:gfhgweoitvasdf5khhvzrlclry

Roles, Stacks, Histories: A Triple for Hoare [chapter]

Johannes Borgström, Andrew D. Gordon, Riccardo Pucella
2010 Reflections on the Work of C.A.R. Hoare  
The theoretical foundation for F7 and its type system is RCF, which is the standard Fixpoint Calculus (FPC, a typed call-by-value λ-calculus with sums, pairs, and iso-recursive types) (Plotkin 1985; Gunter  ...  The appendices include the direct encoding of our calculus RIF within the existing calculus RCF.  ...  Roles, stacks, histories: A triple for Hoare  ... 
doi:10.1007/978-1-84882-912-1_4 fatcat:nwfbhxytmfa4xd5i4y5lvzowii

Retrenching partial requirements into system definitions: a simple feature interaction case study

R. Banach, M. Poppleton
2003 Requirements Engineering  
Retrenchment is a formal technique intended to capture some of the informal approach to a refinable abstract model in a formal manner that will integrate with refinement.  ...  formalism is applicable in a reengineering context, where the subsequent evolution of a system may be partly incompatible with earlier design decisions.  ...  We are working in a straightforward transition system based framework.  ... 
doi:10.1007/s00766-002-0157-6 fatcat:lqtvjuvyjvhpnmy75m3d7n7eo4

Verifying the SRT division algorithm using theorem proving techniques [chapter]

E. M. Clarke, S. M. German, X. Zhao
1996 Lecture Notes in Computer Science  
The circuit and its correctness conditions are formalized as a set of algebraic relations on the real numbers.  ...  We overcome the need for detailed proof guidance in this example by using a powerful theorem prover called Analytica.  ...  Due to space limitations, the paper in this volume of conference proceedings is abridged. A more complete version is available on request from the authors. The complete paper has several appendices.  ... 
doi:10.1007/3-540-61474-5_62 fatcat:grj6fdr4nre2xdbe74cion7n74

The Agda Universal Algebra Library, Part 1: Foundation [article]

William DeMeo
2021 arXiv   pre-print
Special attention is given to aspects of the library that seem most interesting or challenging from a type theory or mathematical foundations perspective.  ...  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in dependent type theory using the Agda  ...  Finally, our own research experience has taught us that a proof assistant and programming language (like Agda), when equipped with specialized libraries and domain-specific tactics to automate the proof  ... 
arXiv:2103.05581v3 fatcat:cuaw4ahd3bdhlmmxctvapcyfs4

Semi-intelligible Isar Proofs from Machine-Generated Proofs

Jasmin Christian Blanchette, Sascha Böhme, Mathias Fleury, Steffen Juilf Smolka, Albert Steckermeier
2015 Journal of automated reasoning  
As a safeguard against bugs, the proofs found by the external provers are reconstructed in Isabelle.  ...  Sledgehammer is a component of the Isabelle/HOL proof assistant that integrates external automatic theorem provers (ATPs) to discharge interactive proof obligations.  ...  The proof keyword optionally takes a tactic as argument to transform the goal.  ... 
doi:10.1007/s10817-015-9335-3 fatcat:3g7sgsv4lnaonli6lgrf6z2u2y
« Previous Showing results 1 — 15 out of 414 results