Changeset 21300d7 for src/ResolvExpr

Timestamp:

Jun 12, 2019, 4:06:37 PM (5 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

462a7c7, d60780c

Parents:

aaeacf4 (diff), 6625727 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg.uwaterloo.ca:software/cfa/cfa-cc

Location:

src/ResolvExpr

Files:

• AdjustExprType.cc (modified) (6 diffs)
• AlternativeFinder.cc (modified) (7 diffs)
• AlternativeFinder.h (modified) (1 diff)
• Candidate.hpp (modified) (3 diffs)
• CandidateFinder.cpp (modified) (1 diff)
• CandidateFinder.hpp (modified) (3 diffs)
• CurrentObject.cc (modified) (1 diff)
• CurrentObject.h (modified) (1 diff)
• ExplodedActual.cc (modified) (2 diffs)
• ExplodedActual.h (modified) (2 diffs)
• ExplodedArg.cpp (added)
• ExplodedArg.hpp (added)
• ResolvMode.h (modified) (2 diffs)
• Resolver.cc (modified) (14 diffs)
• Resolver.h (modified) (3 diffs)
• SatisfyAssertions.cpp (added)
• SatisfyAssertions.hpp (added)
• Unify.cc (modified) (1 diff)
• Unify.h (modified) (1 diff)
• module.mk (modified) (2 diffs)
• typeops.h (modified) (1 diff)

src/ResolvExpr/AdjustExprType.cc

@@ -5 +5 @@
 // file "LICENCE" distributed with Cforall.
 //
-// AdjustExprType.cc --
+// AdjustExprType_old.cc --
 //
 // Author           : Richard C. Bilson
@@ -14 +14 @@
 //
 
+#include "AST/Node.hpp"
+#include "AST/Pass.hpp"
+#include "AST/SymbolTable.hpp"
+#include "AST/Type.hpp"
+#include "AST/TypeEnvironment.hpp"
 #include "Common/PassVisitor.h"
 #include "SymTab/Indexer.h"       // for Indexer
@@ -22 +27 @@
 
 namespace ResolvExpr {
-        class AdjustExprType : public WithShortCircuiting {
-          public:
-                AdjustExprType( const TypeEnvironment & env, const SymTab::Indexer & indexer );
+
+namespace {
+        class AdjustExprType_old final : public WithShortCircuiting {
+                public:
+                AdjustExprType_old( const TypeEnvironment & env, const SymTab::Indexer & indexer );
                 void premutate( VoidType * ) { visit_children = false; }
                 void premutate( BasicType * ) { visit_children = false; }
@@ -44 +51 @@
                 Type * postmutate( TypeInstType *aggregateUseType );
 
-          private:
+                private:
                 const TypeEnvironment & env;
                 const SymTab::Indexer & indexer;
         };
 
-        void adjustExprType( Type *&type, const TypeEnvironment &env, const SymTab::Indexer &indexer ) {
-                PassVisitor<AdjustExprType> adjuster( env, indexer );
-                Type *newType = type->acceptMutator( adjuster );
-                type = newType;
-        }
-
-        void adjustExprType( Type *& type ) {
-                TypeEnvironment env;
-                SymTab::Indexer indexer;
-                adjustExprType( type, env, indexer );
-        }
-
-        AdjustExprType::AdjustExprType( const TypeEnvironment &env, const SymTab::Indexer &indexer )
+        AdjustExprType_old::AdjustExprType_old( const TypeEnvironment &env, const SymTab::Indexer &indexer )
                 : env( env ), indexer( indexer ) {
         }
 
-        Type * AdjustExprType::postmutate( ArrayType * arrayType ) {
+        Type * AdjustExprType_old::postmutate( ArrayType * arrayType ) {
                 PointerType *pointerType = new PointerType{ arrayType->get_qualifiers(), arrayType->base };
                 arrayType->base = nullptr;
@@ -72 +67 @@
         }
 
-        Type * AdjustExprType::postmutate( FunctionType * functionType ) {
+        Type * AdjustExprType_old::postmutate( FunctionType * functionType ) {
                 return new PointerType{ Type::Qualifiers(), functionType };
         }
 
-        Type * AdjustExprType::postmutate( TypeInstType * typeInst ) {
+        Type * AdjustExprType_old::postmutate( TypeInstType * typeInst ) {
                 if ( const EqvClass* eqvClass = env.lookup( typeInst->get_name() ) ) {
                         if ( eqvClass->data.kind == TypeDecl::Ftype ) {
@@ -90 +85 @@
                 return typeInst;
         }
+} // anonymous namespace
+
+void adjustExprType( Type *&type, const TypeEnvironment &env, const SymTab::Indexer &indexer ) {
+        PassVisitor<AdjustExprType_old> adjuster( env, indexer );
+        Type *newType = type->acceptMutator( adjuster );
+        type = newType;
+}
+
+void adjustExprType( Type *& type ) {
+        TypeEnvironment env;
+        SymTab::Indexer indexer;
+        adjustExprType( type, env, indexer );
+}
+
+namespace {
+        struct AdjustExprType_new final : public ast::WithShortCircuiting {
+                const ast::TypeEnvironment & tenv;
+                const ast::SymbolTable & symtab;
+
+                AdjustExprType_new( const ast::TypeEnvironment & e, const ast::SymbolTable & syms )
+                : tenv( e ), symtab( syms ) {}
+
+                void premutate( const ast::VoidType * ) { visit_children = false; }
+                void premutate( const ast::BasicType * ) { visit_children = false; }
+                void premutate( const ast::PointerType * ) { visit_children = false; }
+                void premutate( const ast::ArrayType * ) { visit_children = false; }
+                void premutate( const ast::FunctionType * ) { visit_children = false; }
+                void premutate( const ast::StructInstType * ) { visit_children = false; }
+                void premutate( const ast::UnionInstType * ) { visit_children = false; }
+                void premutate( const ast::EnumInstType * ) { visit_children = false; }
+                void premutate( const ast::TraitInstType * ) { visit_children = false; }
+                void premutate( const ast::TypeInstType * ) { visit_children = false; }
+                void premutate( const ast::TupleType * ) { visit_children = false; }
+                void premutate( const ast::VarArgsType * ) { visit_children = false; }
+                void premutate( const ast::ZeroType * ) { visit_children = false; }
+                void premutate( const ast::OneType * ) { visit_children = false; }
+
+                const ast::Type * postmutate( const ast::ArrayType * at ) {
+                        return new ast::PointerType{ at->base, at->qualifiers };
+                }
+
+                const ast::Type * postmutate( const ast::FunctionType * ft ) {
+                        return new ast::PointerType{ ft };
+                }
+
+                const ast::Type * postmutate( const ast::TypeInstType * inst ) {
+                        // replace known function-type-variables with pointer-to-function
+                        if ( const ast::EqvClass * eqvClass = tenv.lookup( inst->name ) ) {
+                                if ( eqvClass->data.kind == ast::TypeVar::Ftype ) {
+                                        return new ast::PointerType{ inst };
+                                }
+                        } else if ( const ast::NamedTypeDecl * ntDecl = symtab.lookupType( inst->name ) ) {
+                                if ( auto tyDecl = dynamic_cast< const ast::TypeDecl * >( ntDecl ) ) {
+                                        if ( tyDecl->kind == ast::TypeVar::Ftype ) {
+                                                return new ast::PointerType{ inst };
+                                        }
+                                }
+                        }
+                        return inst;
+                }
+        };
+} // anonymous namespace
+
+const ast::Type * adjustExprType( 
+        const ast::Type * type, const ast::TypeEnvironment & env, const ast::SymbolTable & symtab 
+) {
+        ast::Pass<AdjustExprType_new> adjuster{ env, symtab };
+        return type->accept( adjuster );
+}
+
 } // namespace ResolvExpr
 

src/ResolvExpr/AlternativeFinder.cc

@@ -29 +29 @@
 #include "AlternativeFinder.h"
 #include "AST/Expr.hpp"
+#include "AST/SymbolTable.hpp"
 #include "AST/Type.hpp"
 #include "Common/SemanticError.h"  // for SemanticError
@@ -115 +116 @@
                 /// Finds matching alternatives for a function, given a set of arguments
                 template<typename OutputIterator>
-                void makeFunctionAlternatives( const Alternative &func, FunctionType *funcType, const ExplodedArgs& args, OutputIterator out );
+                void makeFunctionAlternatives( const Alternative &func, FunctionType *funcType, const ExplodedArgs_old& args, OutputIterator out );
                 /// Sets up parameter inference for an output alternative
                 template< typename OutputIterator >
@@ -266 +267 @@
                         SemanticError( expr, "No reasonable alternatives for expression " );
                 }
-                if ( mode.resolveAssns || mode.prune ) {
+                if ( mode.satisfyAssns || mode.prune ) {
                         // trim candidates just to those where the assertions resolve
                         // - necessary pre-requisite to pruning
@@ -592 +593 @@
 
                 /// Gets the list of exploded alternatives for this pack
-                const ExplodedActual& getExpl( const ExplodedArgs& args ) const {
+                const ExplodedActual& getExpl( const ExplodedArgs_old& args ) const {
                         return args[nextArg-1][explAlt];
                 }
@@ -616 +617 @@
         /// Instantiates an argument to match a formal, returns false if no results left
         bool instantiateArgument( Type* formalType, Initializer* initializer,
-                        const ExplodedArgs& args, std::vector<ArgPack>& results, std::size_t& genStart,
+                        const ExplodedArgs_old& args, std::vector<ArgPack>& results, std::size_t& genStart,
                         const SymTab::Indexer& indexer, unsigned nTuples = 0 ) {
                 if ( TupleType * tupleType = dynamic_cast<TupleType*>( formalType ) ) {
@@ -888 +889 @@
         template<typename OutputIterator>
         void AlternativeFinder::Finder::makeFunctionAlternatives( const Alternative &func,
-                        FunctionType *funcType, const ExplodedArgs &args, OutputIterator out ) {
+                        FunctionType *funcType, const ExplodedArgs_old &args, OutputIterator out ) {
                 OpenVarSet funcOpenVars;
                 AssertionSet funcNeed, funcHave;
@@ -1020 +1021 @@
 
                 // pre-explode arguments
-                ExplodedArgs argExpansions;
+                ExplodedArgs_old argExpansions;
                 argExpansions.reserve( argAlternatives.size() );
 

src/ResolvExpr/AlternativeFinder.h

@@ -37 +37 @@
         /// First index is which argument, second index is which alternative for that argument,
         /// third index is which exploded element of that alternative
-        using ExplodedArgs = std::vector< std::vector< ExplodedActual > >;
+        using ExplodedArgs_old = std::vector< std::vector< ExplodedActual > >;
 
         class AlternativeFinder {

src/ResolvExpr/Candidate.hpp

@@ -30 +30 @@
         /// A list of unresolved assertions
         using AssertionList = std::vector<AssertionSet::value_type>;
+
+        /// Convenience to merge AssertionList into AssertionSet
+        static inline void mergeAssertionSet( AssertionSet & dst, const AssertionList & src ) {
+                for ( const auto & s : src ) { dst.emplace( s ); }
+        }
 }
 
@@ -42 +47 @@
         ast::OpenVarSet open;      ///< Open variables for environment
         ast::AssertionList need;   ///< Assertions which need to be resolved
+
+        Candidate() : expr(), cost( Cost::zero ), cvtCost( Cost::zero ), env(), open(), need() {}
+        
+        Candidate( const ast::Expr * x, const ast::TypeEnvironment & e )
+        : expr( x ), cost( Cost::zero ), cvtCost( Cost::zero ), env( e ), open(), need() {}
+
+        Candidate( const Candidate & o, const ast::Expr * x )
+        : expr( x ), cost( o.cost ), cvtCost( Cost::zero ), env( o.env ), open( o.open ), 
+          need( o.need ) {}
+        
+        Candidate( 
+                const ast::Expr * x, ast::TypeEnvironment && e, ast::OpenVarSet && o, 
+                ast::AssertionSet && n, const Cost & c )
+        : expr( x ), cost( c ), cvtCost( Cost::zero ), env( std::move( e ) ), open( std::move( o ) ), 
+          need( n.begin(), n.end() ) {}
 };
 
@@ -49 +69 @@
 /// List of candidates
 using CandidateList = std::vector< CandidateRef >;
+
+/// Splice src after dst, clearing src
+static inline void splice( CandidateList & dst, CandidateList & src ) {
+        dst.reserve( dst.size() + src.size() );
+        for ( CandidateRef & r : src ) { dst.emplace_back( std::move( r ) ); }
+        src.clear();
+}
+
+/// Splice src before dst
+static inline void spliceBegin( CandidateList & dst, CandidateList & src ) {
+        splice( src, dst );
+        dst.swap( src );
+}
+
+/// Sum the cost of a list of candidates
+static inline Cost sumCost( const CandidateList & candidates ) {
+        Cost total = Cost::zero;
+        for ( const CandidateRef & r : candidates ) { total += r->cost; }
+        return total;
+}
+
+/// Holdover behaviour from old `findMinCost` -- xxx -- can maybe be eliminated?
+static inline void promoteCvtCost( CandidateList & candidates ) {
+        for ( CandidateRef & r : candidates ) {
+                r->cost = r->cvtCost;
+        }
+}
 
 void print( std::ostream & os, const Candidate & cand, Indenter indent = {} );

src/ResolvExpr/CandidateFinder.cpp

@@ -16 +16 @@
 #include "CandidateFinder.hpp"
 
+#include <deque>
+#include <iterator>               // for back_inserter
+#include <sstream>
+#include <string>
+#include <unordered_map>
+#include <vector>
+
+#include "Candidate.hpp"
+#include "CompilationState.h"
+#include "Cost.h"
+#include "ExplodedArg.hpp"
+#include "Resolver.h"
+#include "SatisfyAssertions.hpp"
+#include "typeops.h"              // for adjustExprType
+#include "Unify.h"
 #include "AST/Expr.hpp"
+#include "AST/Node.hpp"
+#include "AST/Pass.hpp"
+#include "AST/Print.hpp"
+#include "AST/SymbolTable.hpp"
+#include "AST/Type.hpp"
+#include "SymTab/Mangler.h"
+#include "Tuples/Tuples.h"        // for handleTupleAssignment
+
+#define PRINT( text ) if ( resolvep ) { text }
 
 namespace ResolvExpr {
 
+namespace {
+
+        /// First index is which argument, second is which alternative, third is which exploded element
+        using ExplodedArgs_new = std::deque< std::vector< ExplodedArg > >;
+
+        /// Returns a list of alternatives with the minimum cost in the given list
+        CandidateList findMinCost( const CandidateList & candidates ) {
+                CandidateList out;
+                Cost minCost = Cost::infinity;
+                for ( const CandidateRef & r : candidates ) {
+                        if ( r->cost < minCost ) {
+                                minCost = r->cost;
+                                out.clear();
+                                out.emplace_back( r );
+                        } else if ( r->cost == minCost ) {
+                                out.emplace_back( r );
+                        }
+                }
+                return out;
+        }
+
+        /// Computes conversion cost for a given candidate
+        Cost computeApplicationConversionCost( 
+                const CandidateRef & cand, const ast::SymbolTable & symtab 
+        ) {
+                #warning unimplemented
+                (void)cand; (void)symtab;
+                assert(false);
+                return Cost::infinity;
+        }
+
+        /// Actually visits expressions to find their candidate interpretations
+        struct Finder final : public ast::WithShortCircuiting {
+                CandidateFinder & selfFinder;
+                const ast::SymbolTable & symtab;
+                CandidateList & candidates;
+                const ast::TypeEnvironment & tenv;
+                ast::ptr< ast::Type > & targetType;
+
+                Finder( CandidateFinder & f )
+                : selfFinder( f ), symtab( f.symtab ), candidates( f.candidates ), tenv( f.env ), 
+                  targetType( f.targetType ) {}
+                
+                void previsit( const ast::Node * ) { visit_children = false; }
+
+                /// Convenience to add candidate to list
+                template<typename... Args>
+                void addCandidate( Args &&... args ) {
+                        candidates.emplace_back( new Candidate{ std::forward<Args>( args )... } );
+                }
+
+                void postvisit( const ast::ApplicationExpr * applicationExpr ) {
+                        addCandidate( applicationExpr, tenv );
+                }
+
+                /// Builds a list of candidates for a function, storing them in out
+                void makeFunctionCandidates(
+                        const CandidateRef & func, const ast::FunctionType * funcType, 
+                        const ExplodedArgs_new & args, CandidateList & out
+                ) {
+                        #warning unimplemented
+                        (void)func; (void)funcType; (void)args; (void)out;
+                        assert(false);
+                }
+
+                /// Adds implicit struct-conversions to the alternative list
+                void addAnonConversions( const CandidateRef & cand ) {
+                        #warning unimplemented
+                        (void)cand;
+                        assert(false);
+                }
+
+                void postvisit( const ast::UntypedExpr * untypedExpr ) {
+                        CandidateFinder funcFinder{ symtab, tenv };
+                        funcFinder.find( untypedExpr->func, ResolvMode::withAdjustment() );
+                        // short-circuit if no candidates
+                        if ( funcFinder.candidates.empty() ) return;
+
+                        std::vector< CandidateFinder > argCandidates = 
+                                selfFinder.findSubExprs( untypedExpr->args );
+                        
+                        // take care of possible tuple assignments
+                        // if not tuple assignment, handled as normal function call
+                        Tuples::handleTupleAssignment( selfFinder, untypedExpr, argCandidates );
+
+                        // find function operators
+                        ast::ptr< ast::Expr > opExpr = new ast::NameExpr{ untypedExpr->location, "?()" };
+                        CandidateFinder opFinder{ symtab, tenv };
+                        // okay if there aren't any function operations
+                        opFinder.find( opExpr, ResolvMode::withoutFailFast() );
+                        PRINT(
+                                std::cerr << "known function ops:" << std::endl;
+                                print( std::cerr, opFinder.candidates, 1 );
+                        )
+
+                        // pre-explode arguments
+                        ExplodedArgs_new argExpansions;
+                        for ( const CandidateFinder & args : argCandidates ) {
+                                argExpansions.emplace_back();
+                                auto & argE = argExpansions.back();
+                                for ( const CandidateRef & arg : args ) { argE.emplace_back( *arg, symtab ); }
+                        }
+
+                        // Find function matches
+                        CandidateList found;
+                        SemanticErrorException errors;
+                        for ( CandidateRef & func : funcFinder ) {
+                                try {
+                                        PRINT(
+                                                std::cerr << "working on alternative:" << std::endl;
+                                                print( std::cerr, *func, 2 );
+                                        )
+
+                                        // check if the type is a pointer to function
+                                        const ast::Type * funcResult = func->expr->result->stripReferences();
+                                        if ( auto pointer = dynamic_cast< const ast::PointerType * >( funcResult ) ) {
+                                                if ( auto function = pointer->base.as< ast::FunctionType >() ) {
+                                                        CandidateRef newFunc{ new Candidate{ *func } };
+                                                        newFunc->expr = 
+                                                                referenceToRvalueConversion( newFunc->expr, newFunc->cost );
+                                                        makeFunctionCandidates( newFunc, function, argExpansions, found );
+                                                }
+                                        } else if ( 
+                                                auto inst = dynamic_cast< const ast::TypeInstType * >( funcResult ) 
+                                        ) {
+                                                if ( const ast::EqvClass * clz = func->env.lookup( inst->name ) ) {
+                                                        if ( auto function = clz->bound.as< ast::FunctionType >() ) {
+                                                                CandidateRef newFunc{ new Candidate{ *func } };
+                                                                newFunc->expr = 
+                                                                        referenceToRvalueConversion( newFunc->expr, newFunc->cost );
+                                                                makeFunctionCandidates( newFunc, function, argExpansions, found );
+                                                        }
+                                                }
+                                        }
+                                } catch ( SemanticErrorException & e ) { errors.append( e ); }
+                        }
+
+                        // Find matches on function operators `?()`
+                        if ( ! opFinder.candidates.empty() ) {
+                                // add exploded function alternatives to front of argument list
+                                std::vector< ExplodedArg > funcE;
+                                funcE.reserve( funcFinder.candidates.size() );
+                                for ( const CandidateRef & func : funcFinder ) { 
+                                        funcE.emplace_back( *func, symtab );
+                                }
+                                argExpansions.emplace_front( std::move( funcE ) );
+
+                                for ( const CandidateRef & op : opFinder ) {
+                                        try {
+                                                // check if type is pointer-to-function
+                                                const ast::Type * opResult = op->expr->result->stripReferences();
+                                                if ( auto pointer = dynamic_cast< const ast::PointerType * >( opResult ) ) {
+                                                        if ( auto function = pointer->base.as< ast::FunctionType >() ) {
+                                                                CandidateRef newOp{ new Candidate{ *op} };
+                                                                newOp->expr = 
+                                                                        referenceToRvalueConversion( newOp->expr, newOp->cost );
+                                                                makeFunctionCandidates( newOp, function, argExpansions, found );
+                                                        }
+                                                }
+                                        } catch ( SemanticErrorException & e ) { errors.append( e ); }
+                                }
+                        }
+
+                        // Implement SFINAE; resolution errors are only errors if there aren't any non-error 
+                        // candidates
+                        if ( found.empty() && ! errors.isEmpty() ) { throw errors; }
+
+                        // Compute conversion costs
+                        for ( CandidateRef & withFunc : found ) {
+                                Cost cvtCost = computeApplicationConversionCost( withFunc, symtab );
+
+                                PRINT(
+                                        auto appExpr = withFunc->expr.strict_as< ast::ApplicationExpr >();
+                                        auto pointer = appExpr->func->result.strict_as< ast::PointerType >();
+                                        auto function = pointer->base.strict_as< ast::FunctionType >();
+                                        
+                                        std::cerr << "Case +++++++++++++ " << appExpr->func << std::endl;
+                                        std::cerr << "parameters are:" << std::endl;
+                                        ast::printAll( std::cerr, function->params, 2 );
+                                        std::cerr << "arguments are:" << std::endl;
+                                        ast::printAll( std::cerr, appExpr->args, 2 );
+                                        std::cerr << "bindings are:" << std::endl;
+                                        ast::print( std::cerr, withFunc->env, 2 );
+                                        std::cerr << "cost is: " << withFunc->cost << std::endl;
+                                        std::cerr << "cost of conversion is:" << cvtCost << std::endl;
+                                )
+
+                                if ( cvtCost != Cost::infinity ) {
+                                        withFunc->cvtCost = cvtCost;
+                                        candidates.emplace_back( std::move( withFunc ) );
+                                }
+                        }
+                        found = std::move( candidates );
+
+                        // use a new list so that candidates are not examined by addAnonConversions twice
+                        CandidateList winners = findMinCost( found );
+                        promoteCvtCost( winners );
+
+                        // function may return a struct/union value, in which case we need to add candidates 
+                        // for implicit conversions to each of the anonymous members, which must happen after 
+                        // `findMinCost`, since anon conversions are never the cheapest
+                        for ( const CandidateRef & c : winners ) {
+                                addAnonConversions( c );
+                        }
+                        spliceBegin( candidates, winners );
+
+                        if ( candidates.empty() && targetType && ! targetType->isVoid() ) {
+                                // If resolution is unsuccessful with a target type, try again without, since it 
+                                // will sometimes succeed when it wouldn't with a target type binding.
+                                // For example:
+                                //   forall( otype T ) T & ?[]( T *, ptrdiff_t );
+                                //   const char * x = "hello world";
+                                //   unsigned char ch = x[0];
+                                // Fails with simple return type binding (xxx -- check this!) as follows:
+                                // * T is bound to unsigned char
+                                // * (x: const char *) is unified with unsigned char *, which fails
+                                // xxx -- fix this better
+                                targetType = nullptr;
+                                postvisit( untypedExpr );
+                        }
+                }
+
+                /// true if expression is an lvalue
+                static bool isLvalue( const ast::Expr * x ) {
+                        return x->result && ( x->result->is_lvalue() || x->result.as< ast::ReferenceType >() );
+                }
+
+                void postvisit( const ast::AddressExpr * addressExpr ) {
+                        CandidateFinder finder{ symtab, tenv };
+                        finder.find( addressExpr->arg );
+                        for ( CandidateRef & r : finder.candidates ) {
+                                if ( ! isLvalue( r->expr ) ) continue;
+                                addCandidate( *r, new ast::AddressExpr{ addressExpr->location, r->expr } );
+                        }
+                }
+
+                void postvisit( const ast::LabelAddressExpr * labelExpr ) {
+                        addCandidate( labelExpr, tenv );
+                }
+
+                void postvisit( const ast::CastExpr * castExpr ) {
+                        #warning unimplemented
+                        (void)castExpr;
+                        assert(false);
+                }
+
+                void postvisit( const ast::VirtualCastExpr * castExpr ) {
+                        assertf( castExpr->result, "Implicit virtual cast targets not yet supported." );
+                        CandidateFinder finder{ symtab, tenv };
+                        // don't prune here, all alternatives guaranteed to have same type
+                        finder.find( castExpr->arg, ResolvMode::withoutPrune() );
+                        for ( CandidateRef & r : finder.candidates ) {
+                                addCandidate( 
+                                        *r, new ast::VirtualCastExpr{ castExpr->location, r->expr, castExpr->result } );
+                        }
+                }
+
+                void postvisit( const ast::UntypedMemberExpr * memberExpr ) {
+                        #warning unimplemented
+                        (void)memberExpr;
+                        assert(false);
+                }
+
+                void postvisit( const ast::MemberExpr * memberExpr ) {
+                        addCandidate( memberExpr, tenv );
+                }
+
+                void postvisit( const ast::NameExpr * variableExpr ) {
+                        #warning unimplemented
+                        (void)variableExpr;
+                        assert(false);
+                }
+
+                void postvisit( const ast::VariableExpr * variableExpr ) {
+                        // not sufficient to just pass `variableExpr` here, type might have changed since
+                        // creation
+                        addCandidate( 
+                                new ast::VariableExpr{ variableExpr->location, variableExpr->var }, tenv );
+                }
+
+                void postvisit( const ast::ConstantExpr * constantExpr ) {
+                        addCandidate( constantExpr, tenv );
+                }
+
+                void postvisit( const ast::SizeofExpr * sizeofExpr ) {
+                        #warning unimplemented
+                        (void)sizeofExpr;
+                        assert(false);
+                }
+
+                void postvisit( const ast::AlignofExpr * alignofExpr ) {
+                        #warning unimplemented
+                        (void)alignofExpr;
+                        assert(false);
+                }
+
+                void postvisit( const ast::UntypedOffsetofExpr * offsetofExpr ) {
+                        #warning unimplemented
+                        (void)offsetofExpr;
+                        assert(false);
+                }
+
+                void postvisit( const ast::OffsetofExpr * offsetofExpr ) {
+                        addCandidate( offsetofExpr, tenv );
+                }
+
+                void postvisit( const ast::OffsetPackExpr * offsetPackExpr ) {
+                        addCandidate( offsetPackExpr, tenv );
+                }
+
+                void postvisit( const ast::LogicalExpr * logicalExpr ) {
+                        CandidateFinder finder1{ symtab, tenv };
+                        finder1.find( logicalExpr->arg1, ResolvMode::withAdjustment() );
+                        if ( finder1.candidates.empty() ) return;
+
+                        CandidateFinder finder2{ symtab, tenv };
+                        finder2.find( logicalExpr->arg2, ResolvMode::withAdjustment() );
+                        if ( finder2.candidates.empty() ) return;
+
+                        for ( const CandidateRef & r1 : finder1.candidates ) {
+                                for ( const CandidateRef & r2 : finder2.candidates ) {
+                                        ast::TypeEnvironment env{ r1->env };
+                                        env.simpleCombine( r2->env );
+                                        ast::OpenVarSet open{ r1->open };
+                                        mergeOpenVars( open, r2->open );
+                                        ast::AssertionSet need;
+                                        mergeAssertionSet( need, r1->need );
+                                        mergeAssertionSet( need, r2->need );
+
+                                        addCandidate(
+                                                new ast::LogicalExpr{ 
+                                                        logicalExpr->location, r1->expr, r2->expr, logicalExpr->isAnd },
+                                                std::move( env ), std::move( open ), std::move( need ), 
+                                                r1->cost + r2->cost );
+                                }
+                        }
+                }
+
+                void postvisit( const ast::ConditionalExpr * conditionalExpr ) {
+                        // candidates for condition
+                        CandidateFinder finder1{ symtab, tenv };
+                        finder1.find( conditionalExpr->arg1, ResolvMode::withAdjustment() );
+                        if ( finder1.candidates.empty() ) return;
+
+                        // candidates for true result
+                        CandidateFinder finder2{ symtab, tenv };
+                        finder2.find( conditionalExpr->arg2, ResolvMode::withAdjustment() );
+                        if ( finder2.candidates.empty() ) return;
+
+                        // candidates for false result
+                        CandidateFinder finder3{ symtab, tenv };
+                        finder3.find( conditionalExpr->arg3, ResolvMode::withAdjustment() );
+                        if ( finder3.candidates.empty() ) return;
+
+                        for ( const CandidateRef & r1 : finder1.candidates ) {
+                                for ( const CandidateRef & r2 : finder2.candidates ) {
+                                        for ( const CandidateRef & r3 : finder3.candidates ) {
+                                                ast::TypeEnvironment env{ r1->env };
+                                                env.simpleCombine( r2->env );
+                                                env.simpleCombine( r3->env );
+                                                ast::OpenVarSet open{ r1->open };
+                                                mergeOpenVars( open, r2->open );
+                                                mergeOpenVars( open, r3->open );
+                                                ast::AssertionSet need;
+                                                mergeAssertionSet( need, r1->need );
+                                                mergeAssertionSet( need, r2->need );
+                                                mergeAssertionSet( need, r3->need );
+                                                ast::AssertionSet have;
+
+                                                // unify true and false results, then infer parameters to produce new 
+                                                // candidates
+                                                ast::ptr< ast::Type > common;
+                                                if ( 
+                                                        unify( 
+                                                                r2->expr->result, r3->expr->result, env, need, have, open, symtab, 
+                                                                common ) 
+                                                ) {
+                                                        #warning unimplemented
+                                                        assert(false);
+                                                }
+                                        }
+                                }
+                        }
+                }
+
+                void postvisit( const ast::CommaExpr * commaExpr ) {
+                        ast::TypeEnvironment env{ tenv };
+                        ast::ptr< ast::Expr > arg1 = resolveInVoidContext( commaExpr->arg1, symtab, env );
+                        
+                        CandidateFinder finder2{ symtab, env };
+                        finder2.find( commaExpr->arg2, ResolvMode::withAdjustment() );
+
+                        for ( const CandidateRef & r2 : finder2.candidates ) {
+                                addCandidate( *r2, new ast::CommaExpr{ commaExpr->location, arg1, r2->expr } );
+                        }
+                }
+
+                void postvisit( const ast::ImplicitCopyCtorExpr * ctorExpr ) {
+                        addCandidate( ctorExpr, tenv );
+                }
+
+                void postvisit( const ast::ConstructorExpr * ctorExpr ) {
+                        CandidateFinder finder{ symtab, tenv };
+                        finder.find( ctorExpr->callExpr, ResolvMode::withoutPrune() );
+                        for ( CandidateRef & r : finder.candidates ) {
+                                addCandidate( *r, new ast::ConstructorExpr{ ctorExpr->location, r->expr } );
+                        }
+                }
+
+                void postvisit( const ast::RangeExpr * rangeExpr ) {
+                        // resolve low and high, accept candidates where low and high types unify
+                        CandidateFinder finder1{ symtab, tenv };
+                        finder1.find( rangeExpr->low, ResolvMode::withAdjustment() );
+                        if ( finder1.candidates.empty() ) return;
+
+                        CandidateFinder finder2{ symtab, tenv };
+                        finder2.find( rangeExpr->high, ResolvMode::withAdjustment() );
+                        if ( finder2.candidates.empty() ) return;
+
+                        for ( const CandidateRef & r1 : finder1.candidates ) {
+                                for ( const CandidateRef & r2 : finder2.candidates ) {
+                                        ast::TypeEnvironment env{ r1->env };
+                                        env.simpleCombine( r2->env );
+                                        ast::OpenVarSet open{ r1->open };
+                                        mergeOpenVars( open, r2->open );
+                                        ast::AssertionSet need;
+                                        mergeAssertionSet( need, r1->need );
+                                        mergeAssertionSet( need, r2->need );
+                                        ast::AssertionSet have;
+
+                                        ast::ptr< ast::Type > common;
+                                        if ( 
+                                                unify( 
+                                                        r1->expr->result, r2->expr->result, env, need, have, open, symtab, 
+                                                        common ) 
+                                        ) {
+                                                ast::RangeExpr * newExpr = 
+                                                        new ast::RangeExpr{ rangeExpr->location, r1->expr, r2->expr };
+                                                newExpr->result = common ? common : r1->expr->result;
+                                                
+                                                #warning unimplemented
+                                                assert(false);
+                                        }
+                                }
+                        }
+                }
+
+                void postvisit( const ast::UntypedTupleExpr * tupleExpr ) {
+                        std::vector< CandidateFinder > subCandidates = 
+                                selfFinder.findSubExprs( tupleExpr->exprs );
+                        std::vector< CandidateList > possibilities;
+                        combos( subCandidates.begin(), subCandidates.end(), back_inserter( possibilities ) );
+
+                        for ( const CandidateList & subs : possibilities ) {
+                                std::vector< ast::ptr< ast::Expr > > exprs;
+                                exprs.reserve( subs.size() );
+                                for ( const CandidateRef & sub : subs ) { exprs.emplace_back( sub->expr ); }
+
+                                ast::TypeEnvironment env;
+                                ast::OpenVarSet open;
+                                ast::AssertionSet need;
+                                for ( const CandidateRef & sub : subs ) {
+                                        env.simpleCombine( sub->env );
+                                        mergeOpenVars( open, sub->open );
+                                        mergeAssertionSet( need, sub->need );
+                                }
+
+                                addCandidate(
+                                        new ast::TupleExpr{ tupleExpr->location, std::move( exprs ) }, 
+                                        std::move( env ), std::move( open ), std::move( need ), sumCost( subs ) );
+                        }
+                }
+
+                void postvisit( const ast::TupleExpr * tupleExpr ) {
+                        addCandidate( tupleExpr, tenv );
+                }
+
+                void postvisit( const ast::TupleIndexExpr * tupleExpr ) {
+                        addCandidate( tupleExpr, tenv );
+                }
+
+                void postvisit( const ast::TupleAssignExpr * tupleExpr ) {
+                        addCandidate( tupleExpr, tenv );
+                }
+
+                void postvisit( const ast::UniqueExpr * unqExpr ) {
+                        CandidateFinder finder{ symtab, tenv };
+                        finder.find( unqExpr->expr, ResolvMode::withAdjustment() );
+                        for ( CandidateRef & r : finder.candidates ) {
+                                // ensure that the the id is passed on so that the expressions are "linked"
+                                addCandidate( *r, new ast::UniqueExpr{ unqExpr->location, r->expr, unqExpr->id } );
+                        }
+                }
+
+                void postvisit( const ast::StmtExpr * stmtExpr ) {
+                        #warning unimplemented
+                        (void)stmtExpr;
+                        assert(false);
+                }
+
+                void postvisit( const ast::UntypedInitExpr * initExpr ) {
+                        #warning unimplemented
+                        (void)initExpr;
+                        assert(false);
+                }
+
+                void postvisit( const ast::InitExpr * ) {
+                        assertf( false, "CandidateFinder should never see a resolved InitExpr." );
+                }
+
+                void postvisit( const ast::DeletedExpr * ) {
+                        assertf( false, "CandidateFinder should never see a DeletedExpr." );
+                }
+
+                void postvisit( const ast::GenericExpr * ) {
+                        assertf( false, "_Generic is not yet supported." );
+                }
+        };
+
+        /// Prunes a list of candidates down to those that have the minimum conversion cost for a given 
+        /// return type. Skips ambiguous candidates.
+        CandidateList pruneCandidates( CandidateList & candidates ) {
+                struct PruneStruct {
+                        CandidateRef candidate;
+                        bool ambiguous;
+
+                        PruneStruct() = default;
+                        PruneStruct( const CandidateRef & c ) : candidate( c ), ambiguous( false ) {}
+                };
+
+                // find lowest-cost candidate for each type
+                std::unordered_map< std::string, PruneStruct > selected;
+                for ( CandidateRef & candidate : candidates ) {
+                        std::string mangleName;
+                        {
+                                ast::ptr< ast::Type > newType = candidate->expr->result;
+                                candidate->env.apply( newType );
+                                mangleName = Mangle::mangle( newType );
+                        }
+
+                        auto found = selected.find( mangleName );
+                        if ( found != selected.end() ) {
+                                if ( candidate->cost < found->second.candidate->cost ) {
+                                        PRINT(
+                                                std::cerr << "cost " << candidate->cost << " beats " 
+                                                        << found->second.candidate->cost << std::endl;
+                                        )
+
+                                        found->second = PruneStruct{ candidate };
+                                } else if ( candidate->cost == found->second.candidate->cost ) {
+                                        // if one of the candidates contains a deleted identifier, can pick the other, 
+                                        // since deleted expressions should not be ambiguous if there is another option 
+                                        // that is at least as good
+                                        if ( findDeletedExpr( candidate->expr ) ) {
+                                                // do nothing
+                                                PRINT( std::cerr << "candidate is deleted" << std::endl; )
+                                        } else if ( findDeletedExpr( found->second.candidate->expr ) ) {
+                                                PRINT( std::cerr << "current is deleted" << std::endl; )
+                                                found->second = PruneStruct{ candidate };
+                                        } else {
+                                                PRINT( std::cerr << "marking ambiguous" << std::endl; )
+                                                found->second.ambiguous = true;
+                                        }
+                                } else {
+                                        PRINT(
+                                                std::cerr << "cost " << candidate->cost << " loses to " 
+                                                        << found->second.candidate->cost << std::endl;
+                                        )
+                                }
+                        } else {
+                                selected.emplace_hint( found, mangleName, candidate );
+                        }
+                }
+
+                // report unambiguous min-cost candidates
+                CandidateList out;
+                for ( auto & target : selected ) {
+                        if ( target.second.ambiguous ) continue;
+
+                        CandidateRef cand = target.second.candidate;
+                        
+                        ast::ptr< ast::Type > newResult = cand->expr->result;
+                        cand->env.applyFree( newResult );
+                        cand->expr = ast::mutate_field(
+                                cand->expr.get(), &ast::Expr::result, std::move( newResult ) );
+                        
+                        out.emplace_back( cand );
+                }
+                return out;
+        }
+
+} // anonymous namespace
+
 void CandidateFinder::find( const ast::Expr * expr, ResolvMode mode ) {
-        #warning unimplemented
-        (void)expr; (void)mode;
-        assert(false);
+        // Find alternatives for expression
+        ast::Pass<Finder> finder{ *this };
+        expr->accept( finder );
+
+        if ( mode.failFast && candidates.empty() ) {
+                SemanticError( expr, "No reasonable alternatives for expression " );
+        }
+
+        if ( mode.satisfyAssns || mode.prune ) {
+                // trim candidates to just those where the assertions are satisfiable
+                // - necessary pre-requisite to pruning
+                CandidateList satisfied;
+                std::vector< std::string > errors;
+                for ( auto & candidate : candidates ) {
+                        satisfyAssertions( *candidate, symtab, satisfied, errors );
+                }
+
+                // fail early if none such
+                if ( mode.failFast && satisfied.empty() ) {
+                        std::ostringstream stream;
+                        stream << "No alternatives with satisfiable assertions for " << expr << "\n";
+                        for ( const auto& err : errors ) {
+                                stream << err;
+                        }
+                        SemanticError( expr->location, stream.str() );
+                }
+
+                // reset candidates
+                candidates = std::move( satisfied );
+        }
+
+        if ( mode.prune ) {
+                // trim candidates to single best one
+                PRINT(
+                        std::cerr << "alternatives before prune:" << std::endl;
+                        print( std::cerr, candidates );
+                )
+
+                CandidateList pruned = pruneCandidates( candidates );
+                
+                if ( mode.failFast && pruned.empty() ) {
+                        std::ostringstream stream;
+                        CandidateList winners = findMinCost( candidates );
+                        stream << "Cannot choose between " << winners.size() << " alternatives for "
+                                "expression\n";
+                        ast::print( stream, expr );
+                        stream << " Alternatives are:\n";
+                        print( stream, winners, 1 );
+                        SemanticError( expr->location, stream.str() );
+                }
+
+                auto oldsize = candidates.size();
+                candidates = std::move( pruned );
+
+                PRINT(
+                        std::cerr << "there are " << oldsize << " alternatives before elimination" << std::endl;
+                )
+                PRINT(
+                        std::cerr << "there are " << candidates.size() << " alternatives after elimination" 
+                                << std::endl;
+                )
+        }
+
+        // adjust types after pruning so that types substituted by pruneAlternatives are correctly 
+        // adjusted
+        if ( mode.adjust ) {
+                for ( CandidateRef & r : candidates ) {
+                        r->expr = ast::mutate_field( 
+                                r->expr.get(), &ast::Expr::result, 
+                                adjustExprType( r->expr->result, r->env, symtab ) );
+                }
+        }
+
+        // Central location to handle gcc extension keyword, etc. for all expressions
+        for ( CandidateRef & r : candidates ) {
+                if ( r->expr->extension != expr->extension ) {
+                        r->expr.get_and_mutate()->extension = expr->extension;
+                }
+        }
+}
+
+std::vector< CandidateFinder > CandidateFinder::findSubExprs( 
+        const std::vector< ast::ptr< ast::Expr > > & xs 
+) {
+        std::vector< CandidateFinder > out;
+
+        for ( const auto & x : xs ) {
+                out.emplace_back( symtab, env );
+                out.back().find( x, ResolvMode::withAdjustment() );
+                
+                PRINT(
+                        std::cerr << "findSubExprs" << std::endl;
+                        print( std::cerr, out.back().candidates );
+                )
+        }
+
+        return out;
 }
 

src/ResolvExpr/CandidateFinder.hpp

@@ -19 +19 @@
 #include "ResolvMode.h"
 #include "AST/Fwd.hpp"
+#include "AST/Node.hpp"
 #include "AST/SymbolTable.hpp"
 #include "AST/TypeEnvironment.hpp"
@@ -29 +30 @@
         const ast::SymbolTable & symtab;         ///< Symbol table to lookup candidates
         const ast::TypeEnvironment & env;        ///< Substitutions performed in this resolution
-        const ast::Type * targetType = nullptr;  ///< Target type for resolution
+        ast::ptr< ast::Type > targetType = nullptr;  ///< Target type for resolution
 
         CandidateFinder( const ast::SymbolTable & symtab, const ast::TypeEnvironment & env )
@@ -36 +37 @@
         /// Fill candidates with feasible resolutions for `expr`
         void find( const ast::Expr * expr, ResolvMode mode = {} );
+
+        /// Runs new candidate finder on each element in xs, returning the list of finders
+        std::vector< CandidateFinder > findSubExprs( const std::vector< ast::ptr< ast::Expr > > & xs );
+
+        using value_type = CandidateList::value_type;
+        using iterator = CandidateList::iterator;
+        using const_iterator = CandidateList::const_iterator;
+
+        iterator begin() { return candidates.begin(); }
+        const_iterator begin() const { return candidates.begin(); }
+        
+        iterator end() { return candidates.end(); }
+        const_iterator end() const { return candidates.end(); }
 };
 

src/ResolvExpr/CurrentObject.cc

@@ -946 +946 @@
         }
 
-        void CurrentObject::setNext( const ast::Designation * designation ) {
+        const Designation * CurrentObject::findNext( const Designation * designation ) {
+                using DesignatorChain = std::deque< ptr< Expr > >;
+                PRINT( std::cerr << "___findNext" << std::endl; )
+                
+                // find all the d's
+                std::vector< DesignatorChain > desigAlts{ {} }, newDesigAlts;
+                std::deque< const Type * > curTypes{ objStack.back()->getType() }, newTypes;
+                for ( const Expr * expr : designation->designators ) {
+                        PRINT( std::cerr << "____untyped: " << expr << std::endl; )
+                        auto dit = desigAlts.begin();
+                        if ( auto nexpr = dynamic_cast< const NameExpr * >( expr ) ) {
+                                for ( const Type * t : curTypes ) {
+                                        assert( dit != desigAlts.end() );
+
+                                        DesignatorChain & d = *dit;
+                                        PRINT( std::cerr << "____actual: " << t << std::endl; )
+                                        if ( auto refType = dynamic_cast< const ReferenceToType * >( t ) ) {
+                                                // concatenate identical field names
+                                                for ( const Decl * mem : refType->lookup( nexpr->name ) ) {
+                                                        if ( auto field = dynamic_cast< const ObjectDecl * >( mem ) ) {
+                                                                PRINT( std::cerr << "____alt: " << field->type << std::endl; )
+                                                                DesignatorChain d2 = d;
+                                                                d2.emplace_back( new VariableExpr{ expr->location, field } );
+                                                                newDesigAlts.emplace_back( std::move( d2 ) );
+                                                                newTypes.emplace_back( field->type );
+                                                        }
+                                                }
+                                        }
+
+                                        ++dit;
+                                }
+                        } else {
+                                for ( const Type * t : curTypes ) {
+                                        assert( dit != desigAlts.end() );
+
+                                        DesignatorChain & d = *dit;
+                                        if ( auto at = dynamic_cast< const ArrayType * >( t ) ) {
+                                                PRINT( std::cerr << "____alt: " << at->get_base() << std::endl; )
+                                                d.emplace_back( expr );
+                                                newDesigAlts.emplace_back( d );
+                                                newTypes.emplace_back( at->base );
+                                        }
+                                }
+                        }
+
+                        // reset queue
+                        desigAlts = std::move( newDesigAlts );
+                        newDesigAlts.clear();
+                        curTypes = std::move( newTypes );
+                        newTypes.clear();
+                        assertf( desigAlts.size() == curTypes.size(), "Designator alternatives (%zu) and current types (%zu) out of sync", desigAlts.size(), curTypes.size() );
+                }
+
+                if ( desigAlts.size() > 1 ) {
+                        SemanticError( designation, toString("Too many alternatives (", desigAlts.size(), ") for designation: ") );
+                } else if ( desigAlts.empty() ) {
+                        SemanticError( designation, "No reasonable alternatives for designation: " );
+                }
+
+                DesignatorChain & d = desigAlts.back();
+                PRINT( for ( Expression * expr : d ) {
+                        std::cerr << "____desig: " << expr << std::endl;
+                } ) // for
+                assertf( ! curTypes.empty(), "empty designator chosen");
+
+                // set new designators
+                assertf( ! objStack.empty(), "empty object stack when setting designation" );
+                Designation * actualDesignation = 
+                        new Designation{ designation->location, DesignatorChain{d} };
+                objStack.back()->setPosition( d ); // destroys d
+                return actualDesignation;
+        }
+
+        void CurrentObject::setNext( const Designation * designation ) {
                 PRINT( std::cerr << "____setNext" << designation << std::endl; )
                 assertf( ! objStack.empty(), "obj stack empty in setNext" );

src/ResolvExpr/CurrentObject.h

@@ -111 +111 @@
                 CurrentObject( const CodeLocation & loc, const Type * type );
 
+                /// resolves unresolved designation
+                const Designation * findNext( const Designation * designation );
                 /// sets current position using the resolved designation
                 void setNext( const ast::Designation * designation );

src/ResolvExpr/ExplodedActual.cc

@@ -5 +5 @@
 // file "LICENCE" distributed with Cforall.
 //
-// Alternative.h --
+// ExplodedActual.cc --
 //
 // Author           : Aaron B. Moss
@@ -24 +24 @@
         }
 }
+
+// Local Variables: //
+// tab-width: 4 //
+// mode: c++ //
+// compile-command: "make install" //
+// End: //

src/ResolvExpr/ExplodedActual.h

@@ -5 +5 @@
 // file "LICENCE" distributed with Cforall.
 //
-// Alternative.h --
+// ExplodedActual.h --
 //
 // Author           : Aaron B. Moss
@@ -37 +37 @@
         };
 }
+
+// Local Variables: //
+// tab-width: 4 //
+// mode: c++ //
+// compile-command: "make install" //
+// End: //

src/ResolvExpr/ResolvMode.h

@@ -22 +22 @@
                 const bool prune;            ///< Prune alternatives to min-cost per return type? [true]
                 const bool failFast;         ///< Fail on no resulting alternatives? [true]
-                const bool resolveAssns;     ///< Resolve assertions? [false]
+                const bool satisfyAssns;     ///< Satisfy assertions? [false]
 
         private:
-                constexpr ResolvMode(bool a, bool p, bool ff, bool ra) 
-                : adjust(a), prune(p), failFast(ff), resolveAssns(ra) {}
+                constexpr ResolvMode(bool a, bool p, bool ff, bool sa) 
+                : adjust(a), prune(p), failFast(ff), satisfyAssns(sa) {}
 
         public:
                 /// Default settings
-                constexpr ResolvMode() : adjust(false), prune(true), failFast(true), resolveAssns(false) {}
+                constexpr ResolvMode() : adjust(false), prune(true), failFast(true), satisfyAssns(false) {}
                 
                 /// With adjust flag set; turns array and function types into equivalent pointers
@@ -43 +43 @@
                 static constexpr ResolvMode withoutFailFast() { return { true, true, false, false }; }
 
-                /// The same mode, but with resolveAssns turned on; for top-level calls
+                /// The same mode, but with satisfyAssns turned on; for top-level calls
                 ResolvMode atTopLevel() const { return { adjust, prune, failFast, true }; }
         };

src/ResolvExpr/Resolver.cc

@@ -35 +35 @@
 #include "AST/Print.hpp"
 #include "AST/SymbolTable.hpp"
+#include "AST/Type.hpp"
 #include "Common/PassVisitor.h"          // for PassVisitor
 #include "Common/SemanticError.h"        // for SemanticError
@@ -956 +957 @@
                         }
                 };
-
-                /// Check if this expression is or includes a deleted expression
-                const ast::DeletedExpr * findDeletedExpr( const ast::Expr * expr ) {
-                        ast::Pass<DeleteFinder_new> finder;
-                        expr->accept( finder );
-                        return finder.pass.delExpr;
-                }
-
+        } // anonymous namespace
+
+        /// Check if this expression is or includes a deleted expression
+        const ast::DeletedExpr * findDeletedExpr( const ast::Expr * expr ) {
+                ast::Pass<DeleteFinder_new> finder;
+                expr->accept( finder );
+                return finder.pass.delExpr;
+        }
+
+        namespace {
                 /// always-accept candidate filter
                 bool anyCandidate( const Candidate & ) { return true; }
@@ -1023 +1026 @@
 
                         // promote candidate.cvtCost to .cost
-                        for ( CandidateRef & cand : winners ) {
-                                cand->cost = cand->cvtCost;
-                        }
+                        promoteCvtCost( winners );
 
                         // produce ambiguous errors, if applicable
@@ -1099 +1100 @@
                         StripCasts_new::strip( expr );
                 }
-
-                /// Find the expression candidate that is the unique best match for `untyped` in a `void`
-                /// context.
-                ast::ptr< ast::Expr > resolveInVoidContext(
-                        const ast::Expr * expr, const ast::SymbolTable & symtab, ast::TypeEnvironment & env
-                ) {
-                        assertf( expr, "expected a non-null expression" );
-                        
-                        // set up and resolve expression cast to void
-                        ast::CastExpr * untyped = new ast::CastExpr{ expr->location, expr };
-                        CandidateRef choice = findUnfinishedKindExpression( 
-                                untyped, symtab, "", anyCandidate, ResolvMode::withAdjustment() );
-                        
-                        // a cast expression has either 0 or 1 interpretations (by language rules);
-                        // if 0, an exception has already been thrown, and this code will not run
-                        const ast::CastExpr * castExpr = choice->expr.strict_as< ast::CastExpr >();
-                        env = std::move( choice->env );
-
-                        return castExpr->arg;
-                }
-
+        } // anonymous namespace
+
+                
+        ast::ptr< ast::Expr > resolveInVoidContext(
+                const ast::Expr * expr, const ast::SymbolTable & symtab, ast::TypeEnvironment & env
+        ) {
+                assertf( expr, "expected a non-null expression" );
+                
+                // set up and resolve expression cast to void
+                ast::CastExpr * untyped = new ast::CastExpr{ expr->location, expr };
+                CandidateRef choice = findUnfinishedKindExpression( 
+                        untyped, symtab, "", anyCandidate, ResolvMode::withAdjustment() );
+                
+                // a cast expression has either 0 or 1 interpretations (by language rules);
+                // if 0, an exception has already been thrown, and this code will not run
+                const ast::CastExpr * castExpr = choice->expr.strict_as< ast::CastExpr >();
+                env = std::move( choice->env );
+
+                return castExpr->arg;
+        }
+
+        namespace {
                 /// Resolve `untyped` to the expression whose candidate is the best match for a `void` 
                 /// context.
@@ -1146 +1148 @@
                 }
 
+                /// Resolve `untyped` to the single expression whose candidate is the best match
+                ast::ptr< ast::Expr > findSingleExpression( 
+                        const ast::Expr * untyped, const ast::SymbolTable & symtab 
+                ) {
+                        return findKindExpression( untyped, symtab );
+                }
+
                 /// Resolve `untyped` to the single expression whose candidate is the best match for the 
                 /// given type.
@@ -1152 +1161 @@
                 ) {
                         assert( untyped && type );
-                        const ast::Expr * castExpr = new ast::CastExpr{ untyped->location, untyped, type };
-                        ast::ptr< ast::Expr > newExpr = findKindExpression( castExpr, symtab );
+                        ast::ptr< ast::Expr > castExpr = new ast::CastExpr{ untyped->location, untyped, type };
+                        ast::ptr< ast::Expr > newExpr = findSingleExpression( castExpr, symtab );
                         removeExtraneousCast( newExpr, symtab );
                         return newExpr;
@@ -1189 +1198 @@
                         return false;
                 }
+
+                /// Advance a type itertor to the next mutex parameter
+                template<typename Iter>
+                inline bool nextMutex( Iter & it, const Iter & end ) {
+                        while ( it != end && ! (*it)->get_type()->is_mutex() ) { ++it; }
+                        return it != end;
+                }
         }
 
@@ -1213 +1229 @@
                 void previsit( const ast::PointerType * );
 
-                const ast::ExprStmt *   previsit( const ast::ExprStmt * );
-                const ast::AsmExpr *    previsit( const ast::AsmExpr * );
-                const ast::AsmStmt *    previsit( const ast::AsmStmt * );
-                const ast::IfStmt *     previsit( const ast::IfStmt * );
-                const ast::WhileStmt *  previsit( const ast::WhileStmt * );
-                const ast::ForStmt *    previsit( const ast::ForStmt * );
-                const ast::SwitchStmt * previsit( const ast::SwitchStmt * );
-                const ast::CaseStmt *   previsit( const ast::CaseStmt * );
-                const ast::BranchStmt * previsit( const ast::BranchStmt * );
-                const ast::ReturnStmt * previsit( const ast::ReturnStmt * );
-                const ast::ThrowStmt *  previsit( const ast::ThrowStmt * );
-                const ast::CatchStmt *  previsit( const ast::CatchStmt * );
-                void previsit( const ast::WaitForStmt * );
-
-                const ast::SingleInit * previsit( const ast::SingleInit * );
-                const ast::ListInit * previsit( const ast::ListInit * );
-                void previsit( const ast::ConstructorInit * );
+                const ast::ExprStmt *        previsit( const ast::ExprStmt * );
+                const ast::AsmExpr *         previsit( const ast::AsmExpr * );
+                const ast::AsmStmt *         previsit( const ast::AsmStmt * );
+                const ast::IfStmt *          previsit( const ast::IfStmt * );
+                const ast::WhileStmt *       previsit( const ast::WhileStmt * );
+                const ast::ForStmt *         previsit( const ast::ForStmt * );
+                const ast::SwitchStmt *      previsit( const ast::SwitchStmt * );
+                const ast::CaseStmt *        previsit( const ast::CaseStmt * );
+                const ast::BranchStmt *      previsit( const ast::BranchStmt * );
+                const ast::ReturnStmt *      previsit( const ast::ReturnStmt * );
+                const ast::ThrowStmt *       previsit( const ast::ThrowStmt * );
+                const ast::CatchStmt *       previsit( const ast::CatchStmt * );
+                const ast::WaitForStmt *     previsit( const ast::WaitForStmt * );
+
+                const ast::SingleInit *      previsit( const ast::SingleInit * );
+                const ast::ListInit *        previsit( const ast::ListInit * );
+                const ast::ConstructorInit * previsit( const ast::ConstructorInit * );
         };
 
@@ -1381 +1397 @@
                                 "expression." );
                         
-                        const ast::Expr * untyped = 
+                        ast::ptr< ast::Expr > untyped = 
                                 new ast::CastExpr{ caseStmt->location, caseStmt->cond, initAlts.front().type };
-                        ast::ptr< ast::Expr > newExpr = findKindExpression( untyped, symtab );
+                        ast::ptr< ast::Expr > newExpr = findSingleExpression( untyped, symtab );
                         
                         // case condition cannot have a cast in C, so it must be removed here, regardless of 
@@ -1401 +1417 @@
                 if ( branchStmt->kind == ast::BranchStmt::Goto && branchStmt->computedTarget ) {
                         // computed goto argument is void*
+                        ast::ptr< ast::Type > target = new ast::PointerType{ new ast::VoidType{} };
                         branchStmt = ast::mutate_field(
                                 branchStmt, &ast::BranchStmt::computedTarget, 
-                                findSingleExpression( 
-                                        branchStmt->computedTarget, new ast::PointerType{ new ast::VoidType{} }, 
-                                        symtab ) );
+                                findSingleExpression( branchStmt->computedTarget, target, symtab ) );
                 }
                 return branchStmt;
@@ -1445 +1460 @@
         }
 
-        void Resolver_new::previsit( const ast::WaitForStmt * stmt ) {
-                #warning unimplemented; Resolver port in progress
-                (void)stmt;
-                assert(false);
+        const ast::WaitForStmt * Resolver_new::previsit( const ast::WaitForStmt * stmt ) {
+                visit_children = false;
+
+                // Resolve all clauses first
+                for ( unsigned i = 0; i < stmt->clauses.size(); ++i ) {
+                        const ast::WaitForStmt::Clause & clause = stmt->clauses[i];
+
+                        ast::TypeEnvironment env;
+                        CandidateFinder funcFinder{ symtab, env };
+
+                        // Find all candidates for a function in canonical form
+                        funcFinder.find( clause.target.func, ResolvMode::withAdjustment() );
+
+                        if ( funcFinder.candidates.empty() ) {
+                                stringstream ss;
+                                ss << "Use of undeclared indentifier '";
+                                ss << clause.target.func.strict_as< ast::NameExpr >()->name;
+                                ss << "' in call to waitfor";
+                                SemanticError( stmt->location, ss.str() );
+                        }
+
+                        if ( clause.target.args.empty() ) {
+                                SemanticError( stmt->location, 
+                                        "Waitfor clause must have at least one mutex parameter");
+                        }
+
+                        // Find all alternatives for all arguments in canonical form
+                        std::vector< CandidateFinder > argFinders = 
+                                funcFinder.findSubExprs( clause.target.args );
+                        
+                        // List all combinations of arguments
+                        std::vector< CandidateList > possibilities;
+                        combos( argFinders.begin(), argFinders.end(), back_inserter( possibilities ) );
+
+                        // For every possible function:
+                        // * try matching the arguments to the parameters, not the other way around because 
+                        //   more arguments than parameters
+                        CandidateList funcCandidates;
+                        std::vector< CandidateList > argsCandidates;
+                        SemanticErrorException errors;
+                        for ( CandidateRef & func : funcFinder.candidates ) {
+                                try {
+                                        auto pointerType = dynamic_cast< const ast::PointerType * >( 
+                                                func->expr->result->stripReferences() );
+                                        if ( ! pointerType ) {
+                                                SemanticError( stmt->location, func->expr->result.get(), 
+                                                        "candidate not viable: not a pointer type\n" );
+                                        }
+
+                                        auto funcType = pointerType->base.as< ast::FunctionType >();
+                                        if ( ! funcType ) {
+                                                SemanticError( stmt->location, func->expr->result.get(), 
+                                                        "candidate not viable: not a function type\n" );
+                                        }
+
+                                        {
+                                                auto param    = funcType->params.begin();
+                                                auto paramEnd = funcType->params.end();
+
+                                                if( ! nextMutex( param, paramEnd ) ) {
+                                                        SemanticError( stmt->location, funcType, 
+                                                                "candidate function not viable: no mutex parameters\n");
+                                                }
+                                        }
+
+                                        CandidateRef func2{ new Candidate{ *func } };
+                                        // strip reference from function
+                                        func2->expr = referenceToRvalueConversion( func->expr, func2->cost );
+
+                                        // Each argument must be matched with a parameter of the current candidate
+                                        for ( auto & argsList : possibilities ) {
+                                                try {
+                                                        // Declare data structures needed for resolution
+                                                        ast::OpenVarSet open;
+                                                        ast::AssertionSet need, have;
+                                                        ast::TypeEnvironment resultEnv{ func->env };
+                                                        // Add all type variables as open so that those not used in the 
+                                                        // parameter list are still considered open
+                                                        resultEnv.add( funcType->forall );
+
+                                                        // load type variables from arguments into one shared space
+                                                        for ( auto & arg : argsList ) {
+                                                                resultEnv.simpleCombine( arg->env );
+                                                        }
+
+                                                        // Make sure we don't widen any existing bindings
+                                                        resultEnv.forbidWidening();
+
+                                                        // Find any unbound type variables
+                                                        resultEnv.extractOpenVars( open );
+
+                                                        auto param = funcType->params.begin();
+                                                        auto paramEnd = funcType->params.end();
+
+                                                        unsigned n_mutex_param = 0;
+
+                                                        // For every argument of its set, check if it matches one of the 
+                                                        // parameters. The order is important
+                                                        for ( auto & arg : argsList ) {
+                                                                // Ignore non-mutex arguments
+                                                                if ( ! nextMutex( param, paramEnd ) ) {
+                                                                        // We ran out of parameters but still have arguments.
+                                                                        // This function doesn't match
+                                                                        SemanticError( stmt->location, funcType, 
+                                                                                toString("candidate function not viable: too many mutex "
+                                                                                "arguments, expected ", n_mutex_param, "\n" ) );
+                                                                }
+
+                                                                ++n_mutex_param;
+
+                                                                // Check if the argument matches the parameter type in the current 
+                                                                // scope
+                                                                ast::ptr< ast::Type > paramType = (*param)->get_type();
+                                                                if ( 
+                                                                        ! unify( 
+                                                                                arg->expr->result, paramType, resultEnv, need, have, open, 
+                                                                                symtab ) 
+                                                                ) {
+                                                                        // Type doesn't match
+                                                                        stringstream ss;
+                                                                        ss << "candidate function not viable: no known conversion "
+                                                                                "from '";
+                                                                        ast::print( ss, (*param)->get_type() );
+                                                                        ss << "' to '";
+                                                                        ast::print( ss, arg->expr->result );
+                                                                        ss << "' with env '";
+                                                                        ast::print( ss, resultEnv );
+                                                                        ss << "'\n";
+                                                                        SemanticError( stmt->location, funcType, ss.str() );
+                                                                }
+
+                                                                ++param;
+                                                        }
+
+                                                        // All arguments match!
+
+                                                        // Check if parameters are missing
+                                                        if ( nextMutex( param, paramEnd ) ) {
+                                                                do {
+                                                                        ++n_mutex_param;
+                                                                        ++param;
+                                                                } while ( nextMutex( param, paramEnd ) );
+
+                                                                // We ran out of arguments but still have parameters left; this 
+                                                                // function doesn't match
+                                                                SemanticError( stmt->location, funcType, 
+                                                                        toString( "candidate function not viable: too few mutex "
+                                                                        "arguments, expected ", n_mutex_param, "\n" ) );
+                                                        }
+
+                                                        // All parameters match!
+
+                                                        // Finish the expressions to tie in proper environments
+                                                        finishExpr( func2->expr, resultEnv );
+                                                        for ( CandidateRef & arg : argsList ) {
+                                                                finishExpr( arg->expr, resultEnv );
+                                                        }
+
+                                                        // This is a match, store it and save it for later
+                                                        funcCandidates.emplace_back( std::move( func2 ) );
+                                                        argsCandidates.emplace_back( std::move( argsList ) );
+
+                                                } catch ( SemanticErrorException & e ) {
+                                                        errors.append( e );
+                                                }
+                                        }
+                                } catch ( SemanticErrorException & e ) {
+                                        errors.append( e );
+                                }
+                        }
+
+                        // Make sure correct number of arguments
+                        if( funcCandidates.empty() ) {
+                                SemanticErrorException top( stmt->location, 
+                                        "No alternatives for function in call to waitfor" );
+                                top.append( errors );
+                                throw top;
+                        }
+
+                        if( argsCandidates.empty() ) {
+                                SemanticErrorException top( stmt->location, 
+                                        "No alternatives for arguments in call to waitfor" ); 
+                                top.append( errors );
+                                throw top;
+                        }
+
+                        if( funcCandidates.size() > 1 ) {
+                                SemanticErrorException top( stmt->location, 
+                                        "Ambiguous function in call to waitfor" );
+                                top.append( errors );
+                                throw top;
+                        }
+                        if( argsCandidates.size() > 1 ) {
+                                SemanticErrorException top( stmt->location,
+                                        "Ambiguous arguments in call to waitfor" );
+                                top.append( errors );
+                                throw top;
+                        }
+                        // TODO: need to use findDeletedExpr to ensure no deleted identifiers are used.
+
+                        // build new clause
+                        ast::WaitForStmt::Clause clause2;
+                        
+                        clause2.target.func = funcCandidates.front()->expr;
+                        
+                        clause2.target.args.reserve( clause.target.args.size() );
+                        for ( auto arg : argsCandidates.front() ) {
+                                clause2.target.args.emplace_back( std::move( arg->expr ) );
+                        }
+
+                        // Resolve the conditions as if it were an IfStmt, statements normally
+                        clause2.cond = findSingleExpression( clause.cond, symtab );
+                        clause2.stmt = clause.stmt->accept( *visitor );
+
+                        // set results into stmt
+                        auto n = mutate( stmt );
+                        n->clauses[i] = std::move( clause2 );
+                        stmt = n;
+                }
+
+                if ( stmt->timeout.stmt ) {
+                        // resolve the timeout as a size_t, the conditions like IfStmt, and stmts normally
+                        ast::WaitForStmt::Timeout timeout2;
+
+                        ast::ptr< ast::Type > target = 
+                                new ast::BasicType{ ast::BasicType::LongLongUnsignedInt };
+                        timeout2.time = findSingleExpression( stmt->timeout.time, target, symtab );
+                        timeout2.cond = findSingleExpression( stmt->timeout.cond, symtab );
+                        timeout2.stmt = stmt->timeout.stmt->accept( *visitor );
+
+                        // set results into stmt
+                        auto n = mutate( stmt );
+                        n->timeout = std::move( timeout2 );
+                        stmt = n;
+                }
+
+                if ( stmt->orElse.stmt ) {
+                        // resolve the condition like IfStmt, stmts normally
+                        ast::WaitForStmt::OrElse orElse2;
+
+                        orElse2.cond = findSingleExpression( stmt->orElse.cond, symtab );
+                        orElse2.stmt = stmt->orElse.stmt->accept( *visitor );
+
+                        // set results into stmt
+                        auto n = mutate( stmt );
+                        n->orElse = std::move( orElse2 );
+                        stmt = n;
+                }
+
+                return stmt;
         }
 
@@ -1457 +1718 @@
                 // resolve initialization using the possibilities as determined by the `currentObject` 
                 // cursor.
-                ast::Expr * untyped = new ast::UntypedInitExpr{ 
+                ast::ptr< ast::Expr > untyped = new ast::UntypedInitExpr{ 
                         singleInit->location, singleInit->value, currentObject.getOptions() };
-                ast::ptr<ast::Expr> newExpr = findKindExpression( untyped, symtab );
+                ast::ptr<ast::Expr> newExpr = findSingleExpression( untyped, symtab );
                 const ast::InitExpr * initExpr = newExpr.strict_as< ast::InitExpr >();
 
@@ -1510 +1771 @@
                         // iterate designations and initializers in pairs, moving the cursor to the current 
                         // designated object and resolving the initializer against that object
-                        #warning unimplemented; Resolver port in progress
-                        assert(false);
-                }
+                        listInit = ast::mutate_field_index(
+                                listInit, &ast::ListInit::designations, i, 
+                                currentObject.findNext( listInit->designations[i] ) );
+                        listInit = ast::mutate_field_index(
+                                listInit, &ast::ListInit::initializers, i,
+                                listInit->initializers[i]->accept( *visitor ) );
+                }
+
+                // move cursor out of brace-enclosed initializer-list
+                currentObject.exitListInit();
 
                 visit_children = false;
@@ -1518 +1786 @@
         }
 
-        void Resolver_new::previsit( const ast::ConstructorInit * ctorInit ) {
-                #warning unimplemented; Resolver port in progress
-                (void)ctorInit;
-                assert(false);
+        const ast::ConstructorInit * Resolver_new::previsit( const ast::ConstructorInit * ctorInit ) {
+                visitor->maybe_accept( ctorInit, &ast::ConstructorInit::ctor );
+                visitor->maybe_accept( ctorInit, &ast::ConstructorInit::dtor );
+
+                // found a constructor - can get rid of C-style initializer
+                // xxx - Rob suggests this field is dead code
+                ctorInit = ast::mutate_field( ctorInit, &ast::ConstructorInit::init, nullptr );
+
+                // intrinsic single-parameter constructors and destructors do nothing. Since this was 
+                // implicitly generated, there's no way for it to have side effects, so get rid of it to 
+                // clean up generated code
+                if ( InitTweak::isIntrinsicSingleArgCallStmt( ctorInit->ctor ) ) {
+                        ctorInit = ast::mutate_field( ctorInit, &ast::ConstructorInit::ctor, nullptr );
+                }
+                if ( InitTweak::isIntrinsicSingleArgCallStmt( ctorInit->dtor ) ) {
+                        ctorInit = ast::mutate_field( ctorInit, &ast::ConstructorInit::dtor, nullptr );
+                }
+
+                return ctorInit;
         }
 

src/ResolvExpr/Resolver.h

@@ -17 +17 @@
 
 #include <list>          // for list
-#include <AST/Node.hpp>  // for ptr
+
+#include "AST/Node.hpp"  // for ptr
 
 class ConstructorInit;
@@ -29 +30 @@
 namespace ast {
         class Decl;
+        class DeletedExpr;
+        class SymbolTable;
+        class TypeEnvironment;
 } // namespace ast
 
@@ -48 +52 @@
         /// Checks types and binds syntactic constructs to typed representations
         void resolve( std::list< ast::ptr<ast::Decl> >& translationUnit );
+        /// Searches expr and returns the first DeletedExpr found, otherwise nullptr
+        const ast::DeletedExpr * findDeletedExpr( const ast::Expr * expr );
+        /// Find the expression candidate that is the unique best match for `untyped` in a `void`
+        /// context.
+        ast::ptr< ast::Expr > resolveInVoidContext(
+                const ast::Expr * expr, const ast::SymbolTable & symtab, ast::TypeEnvironment & env );
 } // namespace ResolvExpr
 

src/ResolvExpr/Unify.cc

@@ -1143 +1143 @@
                         const ast::ptr<ast::Type> & type1, const ast::ptr<ast::Type> & type2, 
                         ast::TypeEnvironment & env, ast::AssertionSet & need, ast::AssertionSet & have, 
+                        ast::OpenVarSet & open, const ast::SymbolTable & symtab
+        ) {
+                ast::ptr<ast::Type> common;
+                return unify( type1, type2, env, need, have, open, symtab, common );
+        }
+
+        bool unify( 
+                        const ast::ptr<ast::Type> & type1, const ast::ptr<ast::Type> & type2, 
+                        ast::TypeEnvironment & env, ast::AssertionSet & need, ast::AssertionSet & have, 
                         ast::OpenVarSet & open, const ast::SymbolTable & symtab, ast::ptr<ast::Type> & common 
         ) {

src/ResolvExpr/Unify.h

@@ -72 +72 @@
                 const ast::ptr<ast::Type> & type1, const ast::ptr<ast::Type> & type2, 
                 ast::TypeEnvironment & env, ast::AssertionSet & need, ast::AssertionSet & have, 
+                ast::OpenVarSet & open, const ast::SymbolTable & symtab );
+
+        bool unify( 
+                const ast::ptr<ast::Type> & type1, const ast::ptr<ast::Type> & type2, 
+                ast::TypeEnvironment & env, ast::AssertionSet & need, ast::AssertionSet & have, 
                 ast::OpenVarSet & open, const ast::SymbolTable & symtab, ast::ptr<ast::Type> & common );
 

src/ResolvExpr/module.mk

@@ -26 +26 @@
       ResolvExpr/CurrentObject.cc \
       ResolvExpr/ExplodedActual.cc \
+      ResolvExpr/ExplodedArg.cpp \
       ResolvExpr/FindOpenVars.cc \
       ResolvExpr/Occurs.cc \
@@ -35 +36 @@
       ResolvExpr/Resolver.cc \
       ResolvExpr/ResolveTypeof.cc \
+      ResolvExpr/SatisfyAssertions.cpp \
       ResolvExpr/SpecCost.cc \
       ResolvExpr/TypeEnvironment.cc \

src/ResolvExpr/typeops.h

@@ -71 +71 @@
                 } // while
         }
+
+        /// Replaces array types with equivalent pointer, and function types with a pointer-to-function
+        const ast::Type * adjustExprType( 
+                const ast::Type * type, const ast::TypeEnvironment & env, const ast::SymbolTable & symtab );
 
         // in CastCost.cc