Keywords
Checkpoint
PascalFrancis
Racine
Checkpoint
PascalFrancis
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (PascalFrancis)

Index « Keywords » - entrée « Logical programming »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
Logical function < Logical programming < Logical proof  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 58.
[20-40] [0 - 20][0 - 50][40-57][40-60]
Ident.Authors (with country if any)Title
000719 (2003) Jean-Raymond Abrial ; Dominique Cansell [France]Click'n prove: Interactive proofs within Set Theory
000746 (2002) Alexander Bockmayr [France] ; Arnaud Courtois [France]Modélisation de systèmes biologiques en programmation concurrente par contraintes hybrides
000796 (2002) L. Habert [France] ; J.-M. Notin [France] ; D. Galmiche [France]LINK: A proof environment based on proof nets
000881 (2001) Horatiu Cirstea [France]Specifying authentication protocols using rewriting and strategies
000890 (2001) Didier Galmiche [France] ; Daniel Mery [France]Proof-search and countermodel generation in propositional BI logic
000911 (2001) Hubert Comon [France] ; Claude Kirchner [France]Constraint solving on terms
000954 (2000) Proof-search in Type-theoretic Languages
000956 (2000) D. Galmiche [France]Workshop : Type-theoretic languages : Proof-search and semantics
000960 (2000) D. Cansell [France] ; D. Mery [France] ; C. Tabacznyj [France]Tutorial 1 : Abstraction and refinement of concurrent programs and formal specification a practical view
000961 (2000) P. Narendran [États-Unis] ; M. Rusinowitch [France]The theory of total unary RPO is decidable
000963 (2000) A. Felty [États-Unis]The calculus of constructions as a framework for proof search with set variable instantiation
000974 (2000) D. Galmiche [France] ; D. J. Pym [Royaume-Uni]Proof-search in type-theoretic languages : an introduction
000976 (2000) M. W. Bunder [Australie]Proof finding algorithms for implicational logics
000980 (2000) G. Kucherov [France] ; M. Rusinowitch [France]Patterns in words versus patterns in trees : A brief survey and new results
000986 (2000) E. Ritter [Royaume-Uni] ; D. Pym [Royaume-Uni] ; L. Wallen [Royaume-Uni]On the intuitionistic force of classical search
000990 (2000) P. De Groote [France]Linear higher-order matching is NP-complete
000A05 (2000) I. Cervesato [États-Unis] ; J. S. Hodas [États-Unis] ; F. Pfenning [États-Unis]Efficient resource management for linear logic proof search
000A14 (2000) G. Nadathur [États-Unis]Correspondences between classical, intuitionistic and uniform provability
000A16 (2000) D. Galmiche [France]Connection methods in linear logic and proof nets construction
000A17 (2000) L. Bachmair [États-Unis] ; I. V. Ramakrishnan [États-Unis] ; A. Tiwari [États-Unis] ; L. Vigneron [France]Congruence closure modulo associativity and commutativity
000A66 (1999) D. Galmiche [France] ; D. Larchey-Wendling [France]Structural sharing and efficient proof-search in propositional intuitionistic logic

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/KwdEn.i -k "Logical programming" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/KwdEn.i  \
                -Sk "Logical programming" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    indexItem
   |index=    KwdEn.i
   |clé=    Logical programming
}}
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022