blob: 096ffd7530d4b107d9d628d835eaf3679599ab25 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
|
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
<pkgmetadata>
<herd>no-herd</herd>
<maintainer>
<email>quentin.heath@inria.fr</email>
<name>Quentin Heath</name>
<description>Upstream developer</description>
</maintainer>
<longdescription>
Bedwyr is a generalization of logic programming
that allows model checking directly on syntactic expression
possibly containing bindings.
This system, written in OCaml, is a direct implementation of
two recent advances in the theory of proof search:
a symmetric treatment of finite success and finite failure
(which allows capturing both aspects of may and must behavior
in operational semantics and mixing model checking and logic programming),
and direct support for lambda-tree syntax, as in lambdaProlog,
via term-level lambda-binders, higher-order pattern unification,
and the nabla-quantifier.
</longdescription>
<use>
<flag name="tac">Install <pkg>sci-mathematics/tac</pkg></flag>
<flag name="spec">Install Spec, a fork of Bedwyr</flag>
<flag name="rlwrap">Install support for <pkg>app-misc/rlwrap</pkg></flag>
<flag name="ledit">Install support for <pkg>app-misc/ledit</pkg></flag>
</use>
<upstream>http://slimmer.gforge.inria.fr/bedwyr/</upstream>
<bugs-to>https://gforge.inria.fr/tracker/?group_id=367</bugs-to>
</pkgmetadata>
|
GitWeb
