| Commit message (Collapse) | Author | Age |
|---|
| |\ |
|
| | |
| |
| |
| | |
a class is referenced.
|
| |/ |
|
| |
|
|
| |
boogie function calls with "Lit" function.
|
| |
|
|
| |
as candidates for triggers.
|
| |
|
|
|
| |
the test was moved into test\dafny0\modules0.dfy so that bug125.dfy can be
verified that it was resolved to the correct types.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
For the following situation
module LibA {
// ...things declared here...
}
module LibB {
// ...things declared here...
}
module R {
import opened LibA
// ...things declared here...
}
module S refines R {
import opened LibB
// ...declared here...
}
1. If module R declares a TopLevelDecl “G”, then we should report an error if S
attempts to declare an incompatible TopLevelDecl “G”. Dafny does this already.
2. If LibA declares a TopLevelDecl “G” but R does not directly declare any
TopLevelDecl G”, then we should also issue an error for any TopLevelDecl “G”
in S. This behavior is missing in Dafny.
3. If each of LibA and LibB declares some TopLevelDecl “G”, but neither R nor S
directly declares any TopLevelDecl “G”, then no error should be issued, and
any use of “G” in S should resolve to the “G” in LibA. This behavior is missing
in Dafny.
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
expression from
// CanCall[[ var b :| RHS(b,g); Body(b,g,h) ]] =
// (forall b0,b1 :: typeAntecedent ==>
// CanCall[[ RHS(b,g) ]] &&
// (RHS(b,g) ==> CanCall[[ Body(b,g,h) ]]) &&
// $let$canCall(b,g))
to
// CanCall[[ var b0,b1 :| RHS(b0,b1,g); Body(b0,b1,g,h) ]] =
// $let$canCall(g) &&
// CanCall[[ Body($let$b0(g), $let$b1(g), h) ]]
|
| |
|
|
|
|
|
|
| |
instantiate all it arguments, don't stop as soon as one instantiable constructor
is found. Instead, figure out all instantiable constructors and then pick the
best among these. A simple and reasonable "best" is an instantiable constructor
that requires a minimal number of already constructed type arguments, and to
break ties among these, pick the first one listed.
|
| | |
|
| |
|
|
| |
module.
|
| |
|
|
|
|
|
|
|
|
| |
1. A build failure caused by a method call before a contract was fixed.
2. An absolute path in an ".expect" file was changed to relative.
3. I eliminated the TopDecls and DeclModifiers non-terminals.
They were giving a warning from Coco/R about being deletable.
Instead I used repetition of the TopDecl or DeclModifier
non-terminals where they had been used. I think this is
also cleaner to talk about.
|
| |
|
|
|
|
| |
In the prior commit the ExternNegative2.dfy.expect file
was accidentally not included. It is needed in
order for that test to pass.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
The 'extern' declaration modifier provides a more convenient
way of interfacing Dafny code with C# source files and
.Net DLLs.
We support an 'extern' keyword on a module, class, function method,
or method (cannot extern ghost). We check the CompileNames of
all modules to make sure there are no duplicate names.
Every Dafny-generated C# class is marked partial, so it can
potentially be extended.
The extern keyword could be accompanied by an optional string naming
the corresponding C# method/class to connect to. If not given
the name of the method/class is used.
An 'extern' keyword implies an {:axiom} attribute for functions
and methods, so their ensures clauses are assumed to be true
without proof.
In addition to the .dfy files, the user may supply
C# files (.cs) and dynamic linked libraries (.dll) on
command line. These will be passed onto the C# compiler,
the .cs files as sources, and the .dll files as references.
As part of this change the grammar was refactored some.
New productions are
- TopDecls - a list of top-level declarations.
- TopDecl - a single top-level declaration
- DeclModifiers - a list of declaration modifiers which are
either 'abstract', 'ghost', 'static', 'protected', or 'extern'.
They can be in any order and we diagnose duplicates.
In addition, since they are not all allowed in all contexts,
we check and give diagnostics if an DeclModifier appears
where it is not allowed.
|
| | |
|
| |
|
|
| |
empty.
|
| |
|
|
| |
between a module and its refinement base.
|
| |
|
|
| |
bound as undetermined so that iteration will continue.
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
collectors.
|
| |
|
|
| |
collide with the names of its formals.
|
| | |
|
| |
|
|
| |
in MakeAbstractSignature.
|
| |
|
|
| |
merge #24
|
| |
|
|
| |
trying to substitute the nested CasePattern with the BoundVar.
|
| |\ |
|
| | | |
|
| |/
|
|
| |
the auto-triggers can be computed for ForallStmt.
|
| |
|
|
| |
occurrence of Set/MapComprehension when translating it to c#.
|
| |
|
|
| |
LiteralExpr, write out its type instead.
|
| |
|
|
| |
function and connect with Apply1 of the function.
|
| | |
|
| |\ |
|
| | | |
|
| | |
| |
| |
| |
| | |
swap them when the expr is first created in parser or for calcstmt. This
avoids problems of operands being swapped again when the expr is copied.
|
| | |
| |
| |
| |
| | |
need exclude the private terms (the ones that includes the quantifier expr's bv)
from it exported terms.
|
| |\| |
|
| | | |
|
| | |
| |
| |
| | |
DatatypeUpdateExpr if ResovedExpression is not null.
|
| | |
| |
| |
| |
| |
| | |
method that is generated by LetExpr. Change the compiler so that each stmt
writes to its own buffer before add it to the program's buffer so that we can
insert the above mentioned copy instruction before the stmt.
|
| | | |
|
| | |
| |
| |
| | |
it does not depend on the order they appeared.
|
| |/
|
|
| |
version that is less than 3.
|
| |
|
|
| |
protected predicated in cross-module calls) like in other places.
|
| |
|
|
|
| |
The old syntax, D[f := E], is still supported for a short while, but generates a warning about that syntax being deprecated.
The new syntax also supports multiple updates: D.(f := E0, g := E1, h := E2)
|
| | |
|
| |
|
|
|
|
| |
itself,
as well as the signature and body of other functions.
|
| | |
|
qunyanm
Richard L. Ford
Bryan Parno