Filters








56,454 Hits in 6.6 sec

Directional Type Checking for Logic Programs: Beyond Discriminative Types [chapter]

Witold Charatonik
2000 Lecture Notes in Computer Science  
In this paper, using techniques based on tree automata, we show that directional-type checking for logic programs wrt. general regular types is Dexptime-complete and fixed-parameter linear.  ...  Directional types form a type system for logic programs which is based on the view of a predicate as a directional procedure which, when applied to a tuple of input terms, generates a tuple of output terms  ...  Acknowledgments I thank Andreas Podelski for interesting discussions and the anonymous referees for their comments on the paper.  ... 
doi:10.1007/3-540-46425-5_5 fatcat:i2u4dezhi5fnlcn47neyj3srxi

Programmed Strategies for Program Verification

Richard B. Kieburtz
2007 Electronical Notes in Theoretical Computer Science  
Properties refine the type system of Haskell but cannot be verified by type-checking alone; a more powerful logical verifier is needed.  ...  In Programatica, predicate definitions and property assertions written in P-logic, a programming logic for Haskell, can be embedded in the text of a Haskell program module.  ...  Additional predicate constructions go beyond the constructions of Haskell types.  ... 
doi:10.1016/j.entcs.2007.02.045 fatcat:3gnit7ab3zd4hilkj7h2ahsjmu

Using parametric set constraints for locating errors in CLP programs [article]

W. Drabent, J. Maluszynski, P. Pietrzak
2002 arXiv   pre-print
This paper introduces a framework of parametric descriptive directional types for constraint logic programming (CLP).  ...  It proposes a method for locating type errors in CLP programs and presents a prototype debugging tool. The main technique used is checking correctness of programs w.r.t. type specifications.  ...  Acknowledgments We want to thank the anonymous referees for insightful comments and suggestions which resulted in substantial improvements of this paper.  ... 
arXiv:cs/0202010v1 fatcat:viowsmtz35akrhysuawj6dmeje

Combining proofs and programs in a dependently typed language

Chris Casinghino, Vilhelm Sjöberg, Stephanie Weirich
2014 Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '14  
The two fragments may interact: logical expressions may be used as programs; the logic may soundly reason about potentially nonterminating programs; programs can require logical proofs as arguments; and  ...  The two fragments may interact: logical expressions may be used as programs; the logic may soundly reason about potentially nonterminating programs; programs can require logical proofs as arguments; and  ...  The authors would also like to thank the anonymous reviewers for their considered and helpful comments.  ... 
doi:10.1145/2535838.2535883 dblp:conf/popl/CasinghinoSW14 fatcat:zuj6fccdbvgpdd2j3oimh3sozq

Formalizing Semantics with an Automatic Program Verifier [chapter]

Martin Clochard, Jean-Christophe Filliâtre, Claude Marché, Andrei Paskevich
2014 Lecture Notes in Computer Science  
A common belief is that formalizing semantics of programming languages requires the use of a proof assistant providing (1) a specification language with advanced features such as higher-order logic, inductive  ...  definitions, type polymorphism, and (2) a corresponding proof environment where higher-order and inductive reasoning can be performed, typically with user interaction.  ...  We thank Olivier Danvy for proposing these exercises. References  ... 
doi:10.1007/978-3-319-12154-3_3 fatcat:arhini4lrjdldln5bimko5scwm

Polymorphic directional types for logic programming

Pawel Rychlikowski, Tomasz Truderung
2001 Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '01  
We present an algorithm which checks whether or not the program is well typed with respect to a given directional type. This algorithm for discriminative types works in EXPTIME.  ...  Polymorphic directional types well express declarative and procedural properties of logic programs.  ...  Moreover, if for a subterm from the program P the best type during run of ResultType2 was then it was connected with the shape types which cannot be changed by making assumption more accurate.  ... 
doi:10.1145/773184.773192 dblp:conf/ppdp/RychlikowskiT01 fatcat:qccmxnaajneindqgjh7q5evxtu

Programming Creative Behaviour

Taher A. Razik
1976 British Journal of Educational Technology  
The interactions indicate that there were differences among schools within each Scnool Type, and that the directions of difference were not the in both School Types.  ...  The self-pacing, self-directing, and self-administering features of programmed instruction lend themselves directly to the requirements of creativity training, for these characteristics do place the focus  ... 
doi:10.1111/j.1467-8535.1976.tb00743.x fatcat:v4ek45woibezlnrwkl6s4wmeae

Social processes, program verification and all that

ANDREA ASPERTI, HERMAN GEUVERS, RAJA NATARAJAN
2009 Mathematical Structures in Computer Science  
The recent, impressive achievements in the field of interactive theorem proving provide an interesting ground for a critical revisiting of those theses.  ...  We believe that the social nature of proof and program development is uncontroversial and ineluctable but formal verification is not antithetical to it.  ...  In exactly the same way as during program compilation, the process of type checking is not meant to simply discriminate good programs from bad ones.  ... 
doi:10.1017/s0960129509990041 fatcat:q4upavv6lfhfhdn4kqoouauvom

Effective interactive proofs for higher-order imperative programs

Adam Chlipala, Gregory Malecha, Greg Morrisett, Avraham Shinnar, Ryan Wisnesky
2009 Proceedings of the 14th ACM SIGPLAN international conference on Functional programming - ICFP '09  
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant.  ...  We build on the past work on the Ynot system, which is based on Hoare Type Theory.  ...  Sage (Gronski et al. 2006 ) supports hybrid type-checking, where typing invariants may be specified with booleanvalued program functions and checked at runtime.  ... 
doi:10.1145/1596550.1596565 dblp:conf/icfp/ChlipalaMMSW09 fatcat:qc5rox6vt5bchijlgkp6sw4ckm

CommonLoops: merging Lisp and object-oriented programming

Daniel G. Bobrow, Kenneth Kahn, Gregor Kiczales, Larry Masinter, Mark Stefik, Frank Zdybel
1986 SIGPLAN notices  
We discuss three kinds of meta-objects: objects for classes, objects for methods, and objects for discriminators.  ...  Lisp data types are integrated with object classes. With these integrations, it is easy to incrementally move a program between the procedure and object -oriented styles.  ...  Logic programming requires specialized method and discriminator objects to combine method clauses using backtracking search.  ... 
doi:10.1145/960112.28700 fatcat:qexfmdyk3fdxdnwsx3gm2hlxwe

CommonLoops: merging Lisp and object-oriented programming

Daniel G. Bobrow, Kenneth Kahn, Gregor Kiczales, Larry Masinter, Mark Stefik, Frank Zdybel
1986 Conference proceedings on Object-oriented programming systems, languages and applications - OOPLSA '86  
We discuss three kinds of meta-objects: objects for classes, objects for methods, and objects for discriminators.  ...  Lisp data types are integrated with object classes. With these integrations, it is easy to incrementally move a program between the procedure and object -oriented styles.  ...  Logic programming requires specialized method and discriminator objects to combine method clauses using backtracking search.  ... 
doi:10.1145/28697.28700 dblp:conf/oopsla/BobrowKKMSZ86 fatcat:rfs3uf5ezbcjhd3mwajzom7gka

Efficient access mechanisms for tabled logic programs

I.V Ramakrishnan, Prasad Rao, Konstantinos Sagonas, Terrance Swift, David S Warren
1999 The Journal of Logic Programming  
The use of tabling in logic programming allows bottom-up evaluation to be incorporated in a top-down framework, combining advantages of both.  ...  Tries, a variant of discrimination nets, provide complete discrimination for terlns, and permit a lookup and possible insertion to be performed in a single pass through a term.  ...  Ramakrishnan for his help in the preparation and proofreading of this article, and the anonymous reviewers for their many helpful comments.  ... 
doi:10.1016/s0743-1066(98)10013-4 fatcat:7hozzm43rravldeniezyhe4sru

Natural deduction as higher-order resolution

Lawrence C. Paulson
1986 The Journal of Logic Programming  
Isabelle's representation of logical syntax is the typed X-calculus, requiring higherorder unification. It may have potential for logic programming.  ...  They differ primarily in what logic is used for conducting proofs. A new theorem prover, Isabelle, is intended to unify these diverging paths.  ...  Are types essential? Logic programming traditionally uses no types.  ... 
doi:10.1016/0743-1066(86)90015-4 fatcat:d2jkwnbuyzeo7ko2ymi6qvxvpm

Mathematical applications of inductive logic programming

Simon Colton, Stephen Muggleton
2006 Machine Learning  
The application of Inductive Logic Programming to scientific datasets has been highly successful.  ...  It uses third party theorem provers and model generators to check whether the association rules are entailed by a set of user supplied axioms.  ...  We also wish to thank the anonymous reviewers from the ILP'03 conference for their helpful comments on an earlier draft of this paper, and the organisers of that conference for their time and effort.  ... 
doi:10.1007/s10994-006-8259-x fatcat:ph3fuk3xlvgolpktnzwe3rlfn4

Free theorems for functional logic programs

Jan Christiansen, Daniel Seidel, Janis Voigtländer
2010 Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification - PLPV '10  
Type-based reasoning is popular in functional programming.  ...  We see this case study as a stepping stone for a general theory, not provided here, involving the definition of a logical relation and other machinery required for parametricity arguments appropriate to  ...  Acknowledgments We would like to thank Bernd Braßel, Sebastian Fischer, Michael Hanus, Frank Huch, and Fabian Reck for interesting discussions and for comments on a draft of this paper.  ... 
doi:10.1145/1707790.1707797 dblp:conf/plpv/ChristiansenSV10 fatcat:c57wryativdjdlqgscyz6ykj4e
« Previous Showing results 1 — 15 out of 56,454 results