The library has been tested using Agda version <IP_ADDRESS>.
Important changes since 0.16:
Non-backwards compatible changes
Overhaul of safety of the library
-
Currently the library is very difficult to type check with the
--safe
flag as there are unsafe functions scattered throughout the key modules. This means that it is almost impossible to verify the safety of any code depending on the standard library. The following reorganisation will fix this problem after the next full release of Agda. (Agda <IP_ADDRESS> usespostulate
s in theAgda.Builtin.X
that will be removed in the next release). - The following new
Unsafe
modules have been created. Nearly all of these are all marked as unsafe as they use thetrustMe
functionality, either for performance reasons or for informative decidable equality tests.Data.Char.Unsafe Data.Float.Unsafe Data.Nat.Unsafe Data.Nat.DivMod.Unsafe Data.String.Unsafe Data.Word.Unsafe
-
The other modules affected are
Relation.Binary.HeterogeneousEquality.Quotients(.Examples)
which previously postulated function extensionality. The relevant submodules now take extensionality as a module parameter instead of postulating it. If you want to use these results then you should postulate it yourself. - The full list of unsafe modules is:
Data.Char.Unsafe Data.Float.Unsafe Data.Nat.Unsafe Data.Nat.DivMod.Unsafe Data.String.Unsafe Data.Word.Unsafe IO IO.Primitive Reflection Relation.Binary.PropositionalEquality.TrustMe
New codata library
- A new
Codata
library has been added that is based on copatterns and sized types rather than musical notation . The library is built around a generic notion of coinductiveThunk
and provides the basic data types:Codata.Thunk Codata.Colist Codata.Conat Codata.Cofin Codata.Covec Codata.Delay Codata.M Codata.Stream
Each coinductive type comes with a notion of bisimilarity in the corresponding
Codata.X.Bisimilarity
module and at least a couple of proofs demonstrating how they can be used inCodata.X.Properties
. This library is somewhat experimental and may undergo minor changes in later versions. - To avoid confusion, the old codata modules that previously lived in the
Data
directory have been moved to the folderCodata.Musical
Coinduction ↦ Codata.Musical.Notation Data.Cofin ↦ Codata.Musical.Cofin Data.Colist ↦ Codata.Musical.Colist Data.Conat ↦ Codata.Musical.Conat Data.Covec ↦ Codata.Musical.Covec Data.M ↦ Codata.Musical.M Data.Stream ↦ Codata.Musical.Stream
-
Each new-style coinduction type comes with two functions (
fromMusical
andtoMusical
) converting back and forth between old-style coinduction values and new-style ones. -
The type
Costring
and methodtoCostring
have been moved fromData.String
to a new moduleCodata.Musical.Costring
. - The
Rec
construction has been dropped fromCodata.Musical.Notation
as the--guardedness-preserving-type-constructors
flag which made it useful has been removed from Agda.
Improved consistency between Data.(List/Vec).(Any/All/Membership)
-
Added new module
Data.Vec.Any
. -
The type
_∈_
has been moved fromData.Vec
to the new moduleData.Vec.Membership.Propositional
and has been reimplemented usingAny
fromData.Vec.Any
. In particular this means that you must now pass arefl
proof to thehere
constructor. - The proofs associated with
_∈_
have been moved fromData.Vec.Properties
to the new moduleData.Vec.Membership.Propositional.Properties
and have been renamed as follows:∈-++ₗ ↦ ∈-++⁺ˡ ∈-++ᵣ ↦ ∈-++⁺ʳ ∈-map ↦ ∈-map⁺ ∈-tabulate ↦ ∈-tabulate⁺ ∈-allFin ↦ ∈-allFin⁺ ∈-allPairs ↦ ∈-allPairs⁺ ∈⇒List-∈ ↦ ∈-toList⁺ List-∈⇒∈ ↦ ∈-fromList⁺
-
The proofs
All-universal
andAll-irrelevance
have been moved fromData.(List/Vec).All.Properties
and renameduniversal
andirrelevant
inData.(List/Vec).All
. - The existing function
tabulate
inData.Vec.All
has been renameduniversal
. The nametabulate
now refers to a function with following type:tabulate : (∀ i → P (lookup i xs)) → All P xs
Deprecating Data.Fin.Dec
:
-
This module has been deprecated as its non-standard position was causing dependency cycles. The move also makes finding subset properties easier.
- The following proofs have been moved to
Data.Fin.Properties
:decFinSubset, any?, all?, ¬∀⟶∃¬-smallest, ¬∀⟶∃¬
- The following proofs have been moved to
Data.Fin.Subset.Properties
:_∈?_, _⊆?_, nonempty?, anySubset?, decLift
The latter has been renamed to
Lift?
. - The file
Data.Fin.Dec
still exists for backwards compatibility and exports all the old names, but may be removed in some future version.
Rearrangement of algebraic solvers
- Standardised and moved the generic solver modules as follows:
Algebra.RingSolver ↦ Algebra.Solver.Ring Algebra.Monoid-solver ↦ Algebra.Solver.Monoid Algebra.CommutativeMonoidSolver ↦ Algebra.Solver.CommutativeMonoid Algebra.IdempotentCommutativeMonoidSolver ↦ Algebra.Solver.IdempotentCommutativeMonoid
- In order to avoid dependency cycles, special instances of solvers for the following
data types have been moved from
Data.X.Properties
to new modulesData.X.Solver
. The naming conventions for these solver modules have also been standardised.Data.Bool.Properties.RingSolver ↦ Data.Bool.Solver.∨-∧-Solver Data.Bool.Properties.XorRingSolver ↦ Data.Bool.Solver.xor-∧-Solver Data.Integer.Properties.RingSolver ↦ Data.Integer.Solver.+-*-Solver Data.List.Properties.List-solver ↦ Data.List.Solver.++-Solver Data.Nat.Properties.SemiringSolver ↦ Data.Nat.Solver.+-*-Solver Function.Related.TypeIsomorphisms.Solver ↦ Function.Related.TypeIsomorphisms.Solver.×-⊎-Solver
- Renamed
Algebra.Solver.Ring.Natural-coefficients
toAlgebra.Solver.Ring.NaturalCoefficients
.
Overhaul of Data.X.Categorical
- Added new modules:
Category.Comonad Data.List.NonEmpty.Categorical Data.Maybe.Categorical Data.Product.Categorical.Left Data.Product.Categorical.Right Data.Product.N-ary.Categorical Data.Sum.Categorical.Left Data.Sum.Categorical.Right Data.These.Categorical.Left Data.These.Categorical.Right Codata.Colist.Categorical Codata.Covec.Categorical Codata.Delay.Categorical Codata.Stream.Categorical
- In
Data.List.Categorical
renamed:sequence ↦ sequenceM
-
Moved
monad
fromData.List.NonEmpty
toData.List.NonEmpty.Categorical
. -
Moved
functor
,monadT
,monad
,monadZero
andmonadPlus
fromData.Maybe
toData.Maybe.Categorical
. - Created new module
Function.Identity.Categorical
and merged the existing modulesCategory.Functor.Identity
andCategory.Monad.Identity
into it.
Overhaul of Data.Container
, Data.W
and Codata.(Musical.)M
-
Made
Data.Container
(and associated modules) more level-polymorphic -
Created
Data.Container.Core
for the core definition ofContainer
, container morphisms_⇒_
,All
andAny
. This breaks the dependency cycle withData.W
andCodata.Musical.M
. -
Refactored
Data.W
andCodata.Musical.M
to useContainer
.
Rearrangement of constructed relations in Relation.Binary
-
In order to improve the organisation and general searchability of
Relation.Binary
, modules that construct specific binary relations have been moved fromRelation.Binary
toRelation.Binary.Construct
. -
The module
Relation.Binary.Simple
has been split intoConstant
,Always
andNever
. -
The module
Relation.Binary.InducedPreorders
has been split intoRelation.Binary.Construct.FromPred
andRelation.Binary.Construct.FromRel
. -
The full list of changes is as follows:
Relation.Binary.Closure ↦ Relation.Binary.Construct.Closure Relation.Binary.Flip ↦ Relation.Binary.Construct.Flip Relation.Binary.InducedPreorders ↦ Relation.Binary.Construct.FromPred ↘ Relation.Binary.Construct.FromRel Relation.Binary.On ↦ Relation.Binary.Construct.On Relation.Binary.Simple ↦ Relation.Binary.Construct.Always ↘ Relation.Binary.Construct.Never ↘ Relation.Binary.Construct.Constant Relation.Binary.NonStrictToStrict ↦ Relation.Binary.Construct.NonStrictToStrict Relation.Binary.StrictToNonStrict ↦ Relation.Binary.Construct.StrictToNonStrict
Overhaul of Relation.Binary.Indexed
subtree
-
The module
Relation.Binary.Indexed
has been renamedRelation.Binary.Indexed.Heterogeneous
. -
The names
REL
,Rel
,IsEquivalence
andSetoid
inRelation.Binary.Indexed.Heterogeneous
andRelation.Binary.Indexed.Homogeneous
have been deprecated in favour ofIREL
,IRel
,IsIndexedEquivalence
andIndexedSetoid
. This should significantly improves code readability and avoid confusion with the contents ofRelation.Binary
. The old names still exist but have been deprecated. -
The record
IsIndexedEquivalence
inRelation.Binary.Indexed.Homogeneous
is now implemented as a record encapsulating indexed versions of the required properties, unlike the old version which directly indexed equivalences. -
In order to avoid dependency cycles, the
Setoid
record inRelation.Binary
no longer exportsindexedSetoid
. Instead the corresponding indexed setoid can be constructed using thesetoid
function inRelation.Binary.Indexed.Heterogeneous.Construct.Trivial
. -
The function
_at_
inRelation.Binary.Indexed.Heterogeneous
has been moved toRelation.Binary.Indexed.Heterogeneous.Construct.At
and renamed to_atₛ_
.
Overhaul of decidability proofs in numeric base modules
-
Several numeric datatypes such as
Nat/Integer/Fin
had decidability proofs inData.X.Base
. This required several proofs to live inData.X.Base
that should really have been living inData.X.Properties
. For example≤-pred
inData.Nat.Base
. This problem has been growing as more decidability proofs are added. -
To fix this all decidability proofs in
Data.X.Base
forNat
/Integer
/Fin
have been moved toData.X.Properties
fromData.X.Base
. Backwards compatibility has been (nearly completely) preserved by havingData.X
publicly re-export the decidability proofs. If you were using theData.X.Base
module directly and were using decidability queries you should probably switch to useData.X
. -
The following proofs have therefore been moved to the
Properties
files. The old versions remain in the original files but have been deprecated and may be removed at some future version.Data.Nat.≤-pred ↦ Data.Nat.Properties.≤-pred Data.Integer.◃-cong ↦ Data.Integer.Properties.◃-cong Data.Integer.drop‿+≤+ ↦ Data.Integer.Properties.drop‿+≤+ Data.Integer.drop‿-≤- ↦ Data.Integer.Properties.drop‿-≤- Data.Integer.◃-left-inverse ↦ Data.Integer.Properties.◃-inverse
Other
-
The
Data.List.Relation.Sublist
module was misnamed as it contained a subset rather than a sublist relation. It has been correctly renamed toData.List.Relation.Subset
. In its place a new moduleData.List.Relation.Sublist
has been added that correctly implements the sublist relation. -
The types
IrrelevantPred
andIrrelevantRel
inRelation.Binary.PropositionalEquality
have both been renamed toIrrelevant
and have been moved toRelation.Unary
andRelation.Binary
respectively. -
Removed
Data.Char.Core
which was doing nothing of interest. -
In
Data.Maybe.Base
theSet
argument toFrom-just
has been made implicit to be consistent with the definition ofData.Sum
’sFrom-injₙ
. -
In
Data.Product
the function,_
has been renamed to-,_
to avoid conflict with the right section of_,_
. -
Made
Data.Star.Decoration
,Data.Star.Environment
andData.Star.Pointer
more level polymorphic. In particularEdgePred
now takes an extra explicit level parameter. -
In
Level
the target level ofLift
is now explicit. -
In
Function
the precedence level of_$_
(and variants) has been changed to-1
in order to improve its interaction with_∋_
(e.g.f $ Maybe A ∋ do (...)
). -
Relation.Binary
now no longer exports_≡_
,_≢_
andrefl
. The standard way of accessing them remainsRelation.Binary.PropositionalEquality
. -
The syntax
∀[_]
inRelation.Unary
has been renamed toΠ[_]
. The original name is now used for for implicit universal quantifiers.
Other major changes
-
Added new module
Algebra.Properties.CommutativeMonoid
. This contains proofs of lots of properties of summation, including ‘big summation’. -
Added new modules
Data.List.Relation.Permutation.Inductive(.Properties)
, which give an inductive definition of permutations over lists. -
Added a new module
Data.These
for the classic either-or-both Haskell datatype. -
Added new module
Data.List.Relation.Sublist.Inductive
which gives an inductive definition of the sublist relation (i.e. order-preserving embeddings). We also provide a solver for this order inData.List.Relation.Sublist.Inductive.Solver
. -
Added new module
Relation.Binary.Construct.Converse
. This is very similar to the existing moduleRelation.Binary.Construct.Flip
in that it flips the relation. However unlike the existing module, the new module leaves the underlying equality unchanged. -
Added new modules
Relation.Unary.Closure.(Preorder/StrictPartialOrder)
providing closures of a predicate with respect to either a preorder or a strict partial order. -
Added new modules
Relation.Binary.Properties.(DistributiveLattice/HeytingAlgebra)
.
Deprecated features
- All deprecated names now give warnings at point-of-use when type-checked.
The following deprecations have occurred as part of a drive to improve consistency across the library. The deprecated names still exist and therefore all existing code should still work, however they have been deprecated and use of any new names is encouraged. Although not anticipated any time soon, they may eventually be removed in some future release of the library.
- In
Data.Fin.Properties
:≤+≢⇒< ↦ ≤∧≢⇒<
- In
Data.List.Properties
:idIsFold ↦ id-is-foldr ++IsFold ↦ ++-is-foldr mapIsFold ↦ map-is-foldr
- In
Data.Nat.Properties
:≤+≢⇒< ↦ ≤∧≢⇒<
- In
Function.Related
:preorder ↦ R-preorder setoid ↦ SR-setoid EquationReasoning.sym ↦ SR-sym
- In
Function.Related.TypeIsomorphisms
:×-CommutativeMonoid ↦ ×-commutativeMonoid ⊎-CommutativeMonoid ↦ ⊎-commutativeMonoid ×⊎-CommutativeSemiring ↦ ×-⊎-commutativeSemiring
- In
Relation.Binary.Lattice
:BoundedJoinSemilattice.joinSemiLattice ↦ BoundedJoinSemilattice.joinSemilattice BoundedMeetSemilattice.meetSemiLattice ↦ BoundedMeetSemilattice.meetSemilattice
The following have been deprecated without replacement:
- In
Data.Nat.Divisibility
:nonZeroDivisor-lemma
- In
Data.Nat.Properties
:i∸k∸j+j∸k≡i+j∸k im≡jm+n⇒[i∸j]m≡n
- In
Relation.Binary.Construct.Always
Always-setoid ↦ setoid
Other minor additions
- Added new records to
Algebra
:record RawSemigroup c ℓ : Set (suc (c ⊔ ℓ)) record RawGroup c ℓ : Set (suc (c ⊔ ℓ)) record RawSemiring c ℓ : Set (suc (c ⊔ ℓ))
- Added new function
Category.Functor
’sRawFunctor
:_<&>_ : F A → (A → B) → F B
- Added new function to
Category.Monad.Indexed
:RawIMonadT : (T : IFun I f → IFun I f) → Set (i ⊔ suc f)
- Added new function to
Category.Monad
:RawMonadT : (T : (Set f → Set f) → (Set f → Set f)) → Set _
- Added new functions to
Codata.Delay
:alignWith : (These A B → C) → Delay A i → Delay B i → Delay C i zip : Delay A i → Delay B i → Delay (A × B) i align : Delay A i → Delay B i → Delay (These A B) i
- Added new functions to
Codata.Musical.M
:map : (C₁ ⇒ C₂) → M C₁ → M C₂ unfold : (S → ⟦ C ⟧ S) → S → M C
- Added new proof to
Data.Fin.Permutation
:refute : m ≢ n → ¬ Permutation m n
Additionally the definitions
punchIn-permute
andpunchIn-permute′
have been generalised to work with heterogeneous permutations. - Added new proof to
Data.Fin.Properties
:toℕ-fromℕ≤″ : toℕ (fromℕ≤″ m m<n) ≡ m pigeonhole : m < n → (f : Fin n → Fin m) → ∃₂ λ i j → i ≢ j × f i ≡ f j
- Added new function to
Data.List.Any
:head : ¬ Any P xs → Any P (x ∷ xs) → P x toSum : Any P (x ∷ xs) → P x ⊎ Any P xs fromSum : P x ⊎ Any P xs → Any P (x ∷ xs)
- Added new proofs to
Data.List.Any.Properties
:here-injective : here p ≡ here q → p ≡ q there-injective : there p ≡ there q → p ≡ q singleton⁺ : P x → Any P [ x ] singleton⁻ : Any P [ x ] → P x ++-insert : P x → Any P (xs ++ [ x ] ++ ys)
- Added new functions to
Data.List.Base
:uncons : List A → Maybe (A × List A) head : List A → Maybe A tail : List A → Maybe (List A) alignWith : (These A B → C) → List A → List B → List C unalignWith : (A → These B C) → List A → List B × List C align : List A → List B → List (These A B) unalign : List (These A B) → List A × List B
- Added new functions to
Data.List.Categorical
:functor : RawFunctor List applicative : RawApplicative List monadT : RawMonadT (_∘′ List) sequenceA : RawApplicative F → List (F A) → F (List A) mapA : RawApplicative F → (A → F B) → List A → F (List B) forA : RawApplicative F → List A → (A → F B) → F (List B) forM : RawMonad M → List A → (A → M B) → M (List B)
- Added new proofs to
Data.List.Membership.(Setoid/Propositional).Properties
:∈-insert : v ≈ v′ → v ∈ xs ++ [ v′ ] ++ ys ∈-∃++ : v ∈ xs → ∃₂ λ ys zs → ∃ λ w → v ≈ w × xs ≋ ys ++ [ w ] ++ zs
- Added new functions to
Data.List.NonEmpty
:uncons : List⁺ A → A × List A concatMap : (A → List⁺ B) → List⁺ A → List⁺ B alignWith : (These A B → C) → List⁺ A → List⁺ B → List⁺ C zipWith : (A → B → C) → List⁺ A → List⁺ B → List⁺ C unalignWith : (A → These B C) → List⁺ A → These (List⁺ B) (List⁺ C) unzipWith : (A → B × C) → List⁺ A → List⁺ B × List⁺ C align : List⁺ A → List⁺ B → List⁺ (These A B) zip : List⁺ A → List⁺ B → List⁺ (A × B) unalign : List⁺ (These A B) → These (List⁺ A) (List⁺ B) unzip : List⁺ (A × B) → List⁺ A × List⁺ B
- Added new functions to
Data.List.Properties
:alignWith-cong : f ≗ g → alignWith f as ≗ alignWith g as length-alignWith : length (alignWith f xs ys) ≡ length xs ⊔ length ys alignWith-map : alignWith f (map g xs) (map h ys) ≡ alignWith (f ∘′ These.map g h) xs ys map-alignWith : map g (alignWith f xs ys) ≡ alignWith (g ∘′ f) xs ys unalignWith-this : unalignWith this ≗ (_, []) unalignWith-that : unalignWith that ≗ ([] ,_) unalignWith-cong : f ≗ g → unalignWith f ≗ unalignWith g unalignWith-map : unalignWith f (map g ds) ≡ unalignWith (f ∘′ g) ds map-unalignWith : Prod.map (map g) (map h) ∘′ unalignWith f ≗ unalignWith (These.map g h ∘′ f) unalignWith-alignWith : f ∘′ g ≗ id → unalignWith f (alignWith g as bs) ≡ (as , bs)
- Added new function to
Data.Maybe.Base
:fromMaybe : A → Maybe A → A alignWith : (These A B → C) → Maybe A → Maybe B → Maybe C zipWith : (A → B → C) → Maybe A → Maybe B → Maybe C align : Maybe A → Maybe B → Maybe (These A B) zip : Maybe A → Maybe B → Maybe (A × B)
- Added new operator to
Data.Nat.Base
:∣_-_∣ : ℕ → ℕ → ℕ
- Added new proofs to
Data.Nat.Divisibility
:n∣m⇒m%n≡0 : suc n ∣ m → m % (suc n) ≡ 0 m%n≡0⇒n∣m : m % (suc n) ≡ 0 → suc n ∣ m m%n≡0⇔n∣m : m % (suc n) ≡ 0 ⇔ suc n ∣ m
- Added new operations and proofs to
Data.Nat.DivMod
:_%_ : (dividend divisor : ℕ) {≢0 : False (divisor ≟ 0)} → ℕ a≡a%n+[a/n]*n : a ≡ a % suc n + (a div (suc n)) * suc n a%1≡0 : a % 1 ≡ 0 a%n<n : a % suc n < suc n n%n≡0 : suc n % suc n ≡ 0 a%n%n≡a%n : a % suc n % suc n ≡ a % suc n [a+n]%n≡a%n : (a + suc n) % suc n ≡ a % suc n [a+kn]%n≡a%n : (a + k * (suc n)) % suc n ≡ a % suc n kn%n≡0 : k * (suc n) % suc n ≡ 0 %-distribˡ-+ : (a + b) % suc n ≡ (a % suc n + b % suc n) % suc n
- Added new proofs to
Data.Nat.Properties
:_≥?_ : Decidable _≥_ _>?_ : Decidable _>_ _≤′?_ : Decidable _≤′_ _<′?_ : Decidable _<′_ _≤″?_ : Decidable _≤″_ _<″?_ : Decidable _<″_ _≥″?_ : Decidable _≥″_ _>″?_ : Decidable _>″_ n≤0⇒n≡0 : n ≤ 0 → n ≡ 0 m<n⇒n≢0 : m < n → n ≢ 0 m⊓n≡m⇒m≤n : m ⊓ n ≡ m → m ≤ n m⊓n≡n⇒n≤m : m ⊓ n ≡ n → n ≤ m n⊔m≡m⇒n≤m : n ⊔ m ≡ m → n ≤ m n⊔m≡n⇒m≤n : n ⊔ m ≡ n → m ≤ n *-distribˡ-∸ : _*_ DistributesOverˡ _∸_ *-distrib-∸ : _*_ DistributesOver _∸_ ^-*-assoc : (m ^ n) ^ p ≡ m ^ (n * p) ≤-poset : Poset 0ℓ 0ℓ 0ℓ <-resp₂-≡ : _<_ Respects₂ _≡_ <-isStrictPartialOrder : IsStrictPartialOrder _≡_ _<_ <-strictPartialOrder : StrictPartialOrder 0ℓ 0ℓ 0ℓ *-+-isSemiring : IsSemiring _+_ _*_ 0 1 ⊓-semigroup : Semigroup 0ℓ 0ℓ ⊔-semigroup : Semigroup 0ℓ 0ℓ ⊔-0-commutativeMonoid : CommutativeMonoid 0ℓ 0ℓ ⊓-⊔-lattice : Lattice 0ℓ 0ℓ n≡m⇒∣n-m∣≡0 : n ≡ m → ∣ n - m ∣ ≡ 0 m≤n⇒∣n-m∣≡n∸m : m ≤ n → ∣ n - m ∣ ≡ n ∸ m ∣n-m∣≡0⇒n≡m : ∣ n - m ∣ ≡ 0 → n ≡ m ∣n-m∣≡n∸m⇒m≤n : ∣ n - m ∣ ≡ n ∸ m → m ≤ n ∣n-n∣≡0 : ∣ n - n ∣ ≡ 0 ∣n-n+m∣≡m : ∣ n - n + m ∣ ≡ m ∣n+m-n+o∣≡∣m-o| : ∣ n + m - n + o ∣ ≡ ∣ m - o ∣ n∸m≤∣n-m∣ : n ∸ m ≤ ∣ n - m ∣ ∣n-m∣≤n⊔m : ∣ n - m ∣ ≤ n ⊔ m ∣-∣-comm : Commutative ∣_-_∣ ∣n-m∣≡[n∸m]∨[m∸n] : (∣ n - m ∣ ≡ n ∸ m) ⊎ (∣ n - m ∣ ≡ m ∸ n) *-distribˡ-∣-∣ : _*_ DistributesOverˡ ∣_-_∣ *-distribʳ-∣-∣ : _*_ DistributesOverʳ ∣_-_∣ *-distrib-∣-∣ : _*_ DistributesOver ∣_-_∣
- Added new function to
Data.String.Base
:fromList⁺ : List⁺ Char → String
- Added new functions to
Data.Sum
:map₁ : (A → B) → A ⊎ C → B ⊎ C map₂ : (B → C) → A ⊎ B → A ⊎ C
- Added new functions in
Data.Table.Base
:remove : Fin (suc n) → Table A (suc n) → Table A n fromVec : Vec A n → Table A n toVec : Table A n → Vec A n
- Added new proofs in
Data.Table.Properties
:select-lookup : lookup (select x i t) i ≡ lookup t i select-remove : remove i (select x i t) ≗ replicate {n} x remove-permute : remove (π ⟨$⟩ˡ i) (permute π t) ≗ permute (Perm.remove (π ⟨$⟩ˡ i) π) (remove i t)
- Added new functions to
Data.Vec
:alignWith : (These A B → C) → Vec A m → Vec B n → Vec C (m ⊔ n) align : Vec A m → Vec B n → Vec (These A B) (m ⊔ n) unzipWith : (A → B × C) → Vec A n → Vec B n × Vec C n
- Added new proofs to
Data.Vec.All.Properties
:toList⁺ : All P (toList xs) → All P xs toList⁻ : All P xs → All P (toList xs) fromList⁺ : All P xs → All P (fromList xs) fromList⁻ : All P (fromList xs) → All P xs
- Added new functions to
Data.Vec.Any
:head : ¬ Any P xs → Any P (x ∷ xs) → P x toSum : Any P (x ∷ xs) → P x ⊎ Any P xs fromSum : P x ⊎ Any P xs → Any P (x ∷ xs)
- Added new functions to
Data.Vec.Categorical
:sequenceA : RawApplicative F → Vec (F A) n → F (Vec A n) mapA : RawApplicative F → (A → F B) → Vec A n → F (Vec B n) forA : RawApplicative F → Vec A n → (A → F B) → F (Vec B n) sequenceM : RawMonad M → Vec (M A) n → M (Vec A n) mapM : RawMonad M → (A → M B) → Vec A n → M (Vec B n) forM : RawMonad M → Vec A n → (A → M B) → M (Vec B n)
- Added new proofs to
Data.Vec.Membership.Propositional.Properties
:∈-lookup : lookup i xs ∈ xs ∈-toList⁻ : v ∈ toList xs → v ∈ xs ∈-fromList⁻ : v ∈ fromList xs → v ∈ xs
- Added new proof to
Data.Vec.Properties
:lookup-zipWith : lookup i (zipWith f xs ys) ≡ f (lookup i xs) (lookup i ys)
- Added new proofs to
Data.Vec.Relation.Pointwise.Inductive
:tabulate⁺ : (∀ i → f i ~ g i) → Pointwise _~_ (tabulate f) (tabulate g) tabulate⁻ : Pointwise _~_ (tabulate f) (tabulate g) → (∀ i → f i ~ g i)
- Added new type to
Foreign.Haskell
:Pair : (A : Set ℓ) (B : Set ℓ′) : Set (ℓ ⊔ ℓ′)
- Added new function to
Function
:typeOf : {A : Set a} → A → Set a
- Added new functions to
Function.Related
:isEquivalence : IsEquivalence (Related ⌊ k ⌋) ↔-isPreorder : IsPreorder _↔_ (Related k)
- Added new result to
Function.Related.TypeIsomorphisms
:×-comm : (A × B) ↔ (B × A) ×-identityˡ : LeftIdentity _↔_ (Lift ℓ ⊤) _×_ ×-identityʳ : RightIdentity _↔_ (Lift ℓ ⊤) _×_ ×-identity : Identity _↔_ (Lift ℓ ⊤) _×_ ×-zeroˡ : LeftZero _↔_ (Lift ℓ ⊥) _×_ ×-zeroʳ : RightZero _↔_ (Lift ℓ ⊥) _×_ ×-zero : Zero _↔_ (Lift ℓ ⊥) _×_ ⊎-assoc : Associative _↔_ _⊎_ ⊎-comm : (A ⊎ B) ↔ (B ⊎ A) ⊎-identityˡ : LeftIdentity _↔_ (Lift ℓ ⊥) _⊎_ ⊎-identityʳ : RightIdentity _↔_ (Lift ℓ ⊥) _⊎_ ⊎-identity : Identity _↔_ (Lift ℓ ⊥) _⊎_ ×-distribˡ-⊎ : _DistributesOverˡ_ _↔_ _×_ _⊎_ ×-distribʳ-⊎ : _DistributesOverʳ_ _↔_ _×_ _⊎_ ×-distrib-⊎ : _DistributesOver_ _↔_ _×_ _⊎_ ×-isSemigroup : IsSemigroup (Related ⌊ k ⌋) _×_ ×-semigroup : Symmetric-kind → Level → Semigroup _ _ ×-isMonoid : IsMonoid (Related ⌊ k ⌋) _×_ (Lift ℓ ⊤) ×-monoid : Symmetric-kind → Level → Monoid _ _ ×-isCommutativeMonoid : IsCommutativeMonoid (Related ⌊ k ⌋) _×_ (Lift ℓ ⊤) ×-commutativeMonoid : Symmetric-kind → Level → CommutativeMonoid _ _ ⊎-isSemigroup : IsSemigroup (Related ⌊ k ⌋) _⊎_ ⊎-semigroup : Symmetric-kind → Level → Semigroup _ _ ⊎-isMonoid : IsMonoid (Related ⌊ k ⌋) _⊎_ (Lift ℓ ⊥) ⊎-monoid : Symmetric-kind → Level → Monoid _ _ ⊎-isCommutativeMonoid : IsCommutativeMonoid (Related ⌊ k ⌋) _⊎_ (Lift ℓ ⊥) ⊎-commutativeMonoid : Symmetric-kind → Level → CommutativeMonoid _ _ ×-⊎-isCommutativeSemiring : IsCommutativeSemiring (Related ⌊ k ⌋) _⊎_ _×_ (Lift ℓ ⊥) (Lift ℓ ⊤)
- Added new type and function to
Function.Bijection
:From ⤖ To = Bijection (P.setoid From) (P.setoid To) bijection : (∀ {x y} → to x ≡ to y → x ≡ y) → (∀ x → to (from x) ≡ x) → From ⤖ To
- Added new function to
Function.Injection
:injection : (∀ {x y} → to x ≡ to y → x ≡ y) → From ↣ To
- Added new function to
Function.Inverse
:inverse : (∀ x → from (to x) ≡ x) → (∀ x → to (from x) ≡ x) → From ↔ To
- Added new function to
Function.LeftInverse
:leftInverse : (∀ x → from (to x) ≡ x) → From ↞ To
- Added new proofs to
Function.Related
:K-refl : Reflexive (Related k) K-reflexive : _≡_ ⇒ Related k K-trans : Trans (Related k) (Related k) (Related k) K-isPreorder : IsPreorder _↔_ (Related k) SK-sym : Sym (Related ⌊ k ⌋) (Related ⌊ k ⌋) SK-isEquivalence : IsEquivalence (Related ⌊ k ⌋)
- Added new proofs to
Function.Related.TypeIsomorphisms
:×-≡×≡↔≡,≡ : (x ≡ proj₁ p × y ≡ proj₂ p) ↔ (x , y) ≡ p ×-comm : (A × B) ↔ (B × A)
- Added new function to
Function.Surjection
:surjection : (∀ x → to (from x) ≡ x) → From ↠ To
- Added new synonym to
Level
:0ℓ = zero
- Added new module
Level.Literals
with functions:_ℕ+_ : Nat → Level → Level #_ : Nat → Level Levelℕ : Number Level
- Added new proofs to record
IsStrictPartialOrder
inRelation.Binary
:<-respʳ-≈ : _<_ Respectsʳ _≈_ <-respˡ-≈ : _<_ Respectsˡ _≈_
- Added new functions and records to
Relation.Binary.Indexed.Heterogeneous
:record IsIndexedPreorder (_≈_ : Rel A ℓ₁) (_∼_ : Rel A ℓ₂) : Set (i ⊔ a ⊔ ℓ₁ ⊔ ℓ₂) record IndexedPreorder {i} (I : Set i) c ℓ₁ ℓ₂ : Set (suc (i ⊔ c ⊔ ℓ₁ ⊔ ℓ₂))
- Added new proofs to
Relation.Binary.Indexed.Heterogeneous.Construct.At
:isEquivalence : IsIndexedEquivalence A _≈_ → (i : I) → B.IsEquivalence (_≈_ {i}) isPreorder : IsIndexedPreorder A _≈_ _∼_ → (i : I) → B.IsPreorder (_≈_ {i}) _∼_ setoid : IndexedSetoid I a ℓ → I → B.Setoid a ℓ preorder : IndexedPreorder I a ℓ₁ ℓ₂ → I → B.Preorder a ℓ₁ ℓ₂
- Added new proofs to
Relation.Binary.Indexed.Heterogeneous.Construct.Trivial
:isIndexedEquivalence : IsEquivalence _≈_ → IsIndexedEquivalence (λ (_ : I) → A) _≈_ isIndexedPreorder : IsPreorder _≈_ _∼_ → IsIndexedPreorder (λ (_ : I) → A) _≈_ _∼_ indexedSetoid : Setoid a ℓ → ∀ {I} → IndexedSetoid I a ℓ indexedPreorder : Preorder a ℓ₁ ℓ₂ → ∀ {I} → IndexedPreorder I a ℓ₁ ℓ₂
- Added new types, functions and records to
Relation.Binary.Indexed.Homogeneous
:Implies _∼₁_ _∼₂_ = ∀ {i} → _∼₁_ B.⇒ (_∼₂_ {i}) Antisymmetric _≈_ _∼_ = ∀ {i} → B.Antisymmetric _≈_ (_∼_ {i}) Decidable _∼_ = ∀ {i} → B.Decidable (_∼_ {i}) Respects P _∼_ = ∀ {i} {x y : A i} → x ∼ y → P x → P y Respectsˡ P _∼_ = ∀ {i} {x y z : A i} → x ∼ y → P x z → P y z Respectsʳ P _∼_ = ∀ {i} {x y z : A i} → x ∼ y → P z x → P z y Respects₂ P _∼_ = (Respectsʳ P _∼_) × (Respectsˡ P _∼_) Lift _∼_ x y = ∀ i → x i ∼ y i record IsIndexedEquivalence (_≈ᵢ_ : Rel A ℓ) : Set (i ⊔ a ⊔ ℓ) record IsIndexedDecEquivalence (_≈ᵢ_ : Rel A ℓ) : Set (i ⊔ a ⊔ ℓ) record IsIndexedPreorder (_≈ᵢ_ : Rel A ℓ₁) (_∼ᵢ_ : Rel A ℓ₂) : Set (i ⊔ a ⊔ ℓ₁ ⊔ ℓ₂) record IsIndexedPartialOrder (_≈ᵢ_ : Rel A ℓ₁) (_≤ᵢ_ : Rel A ℓ₂) : Set (i ⊔ a ⊔ ℓ₁ ⊔ ℓ₂) record IndexedSetoid {i} (I : Set i) c ℓ : Set (suc (i ⊔ c ⊔ ℓ)) record IndexedDecSetoid {i} (I : Set i) c ℓ : Set (suc (i ⊔ c ⊔ ℓ)) record IndexedPreorder {i} (I : Set i) c ℓ₁ ℓ₂ : Set (suc (i ⊔ c ⊔ ℓ₁ ⊔ ℓ₂)) record IndexedPoset {i} (I : Set i) c ℓ₁ ℓ₂ : Set (suc (i ⊔ c ⊔ ℓ₁ ⊔ ℓ₂))
- Added new types, records and proofs to
Relation.Binary.Lattice
:Exponential _≤_ _∧_ _⇨_ = ∀ w x y → ((w ∧ x) ≤ y → w ≤ (x ⇨ y)) × (w ≤ (x ⇨ y) → (w ∧ x) ≤ y) IsJoinSemilattice.x≤x∨y : x ≤ x ∨ y IsJoinSemilattice.y≤x∨y : y ≤ x ∨ y IsJoinSemilattice.∨-least : x ≤ z → y ≤ z → x ∨ y ≤ z IsMeetSemilattice.x∧y≤x : x ∧ y ≤ x IsMeetSemilattice.x∧y≤y : x ∧ y ≤ y IsMeetSemilattice.∧-greatest : x ≤ y → x ≤ z → x ≤ y ∧ z record IsDistributiveLattice _≈_ _≤_ _∨_ _∧_ record IsHeytingAlgebra _≈_ _≤_ _∨_ _∧_ _⇨_ ⊤ ⊥ record IsBooleanAlgebra _≈_ _≤_ _∨_ _∧_ ¬_ ⊤ ⊥ record DistributiveLattice c ℓ₁ ℓ₂ record HeytingAlgebra c ℓ₁ ℓ₂ record BooleanAlgebra c ℓ₁ ℓ₂
- Added new proofs to
Relation.Binary.NonStrictToStrict
:<⇒≤ : _<_ ⇒ _≤_
- Added new proofs to
Relation.Binary.PropositionalEquality
:respˡ : ∼ Respectsˡ _≡_ respʳ : ∼ Respectsʳ _≡_
- Added new proofs to
Relation.Binary.Construct.Always
:refl : Reflexive Always sym : Symmetric Always trans : Transitive Always isEquivalence : IsEquivalence Always
- Added new proofs to
Relation.Binary.Construct.Constant
:refl : C → Reflexive (Const C) sym : Symmetric (Const C) trans : Transitive (Const C) isEquivalence : C → IsEquivalence (Const C) setoid : C → Setoid a c
- Added new definitions and proofs to
Relation.Binary.Construct.FromPred
:Resp x y = P x → P y reflexive : P Respects _≈_ → _≈_ ⇒ Resp refl : P Respects _≈_ → Reflexive Resp trans : Transitive Resp isPreorder : P Respects _≈_ → IsPreorder _≈_ Resp preorder : P Respects _≈_ → Preorder _ _ _
- Added new definitions and proofs to
Relation.Binary.Construct.FromRel
:Resp x y = ∀ {a} → a R x → a R y reflexive : (∀ {a} → (a R_) Respects _≈_) → _≈_ ⇒ Resp trans : Transitive Resp isPreorder : (∀ {a} → (a R_) Respects _≈_) → IsPreorder _≈_ Resp preorder : (∀ {a} → (a R_) Respects _≈_) → Preorder _ _ _
- Added new proofs to
Relation.Binary.Construct.StrictToNonStrict
:<⇒≤ : _<_ ⇒ _≤_ ≤-respʳ-≈ : Transitive _≈_ → _<_ Respectsʳ _≈_ → _≤_ Respectsʳ _≈_ ≤-respˡ-≈ : Symmetric _≈_ → Transitive _≈_ → _<_ Respectsˡ _≈_ → _≤_ Respectsˡ _≈_ <-≤-trans : Transitive _<_ → _<_ Respectsʳ _≈_ → Trans _<_ _≤_ _<_ ≤-<-trans : Symmetric _≈_ → Transitive _<_ → _<_ Respectsˡ _≈_ → Trans _≤_ _<_ _<_
- Added new types in
Relation.Unary
:Satisfiable P = ∃ λ x → x ∈ P IUniversal P = ∀ {x} → x ∈ P
- Added new proofs in
Relation.Unary.Properties
:∅? : Decidable ∅ U? : Decidable U


{% if calling_page == 'demo' %}
{% help_icon "choose_id_demo" _("on choosing the type of identifier") %}
{% else %}
{% help_icon "choose_id" _("on choosing the type of identifier") %}
{% endif %}
{% if prefixes|duplicate_id_types %}
{% comment %}
class 'ays-ignore' is used by 'are-you-sure.js' which prevents users from accidentally leaving
a form they are working on. In this case, we will allow users to choose between shoulder types.
Although it's best we map already filled in fields over to next profile, which is something we should implement.
{% endcomment %}
{% for p in prefixes %}
{% endfor %}
{% else %}
{% for p in prefixes %}
{% endfor %}
{% endif %}


Vision statement
We are a community of chess enthusiasts at MIT who enjoy one another’s company and encourage others to join in the fun, promoting an atmosphere of lifelong learning!
Mission statement
We serve the chess community at MIT through various programs, partnerships, and events, including casual community gatherings, guest lectures and exhibitions, a competitive national collegiate chess team, regular tournaments, and collaboration with local chess clubs.
Story
For nearly two years before 2016, MIT lacked an active chess club, leaving many avid players stranded with no official organization to arrange meetings, tournaments, or lessons.
In 2016, Tech Chess was born under the steady and enthusiastic leadership of MIT students Alexander Katz, Andy Trattner, Amir Cohen, and Jonah Butler. Our aim is to build a sustainable, awesome organization.
We hosted several successful events in the spring of 2016, including a chess tournament with just under one hundred participants, many of whom attend Harvard or MIT. Tech Chess has become a vibrant community that welcomes beginners and experts with spirited games and opportunities to improve their play.
The Gameplan
- 2016: obtain sponsors, host tournaments, recruit new members, compete in US Amateur East and Pan-Ams, continue building our community
- 2017: reach out to other schools in Boston area for exhibition matches, invite grandmasters to lecture
- 2018: continue competitive play, building officer community, recruiting for team, create local college league
- 2019: expand successful programs to offer library and school outreach, continue competition and community gatherings
Inventory and Resources
- Constitution
- Locker: W20-437 28
Social Media
Like us on Facebook!


Fundamentals of Deep Learning for Computer Vision
A one day workshop introducing the concepts of Deep Learning through the use of Nvidia DIGITS and Caffe in collaboration with Nvidia Deep Learning Institute (DLI). The workshop is held regularly in the University of Sheffield and have been delivered externally at University of Bristol (Train the trainers), UCL (STFC summer school), University of Dundee, University of Glasgow, and University of Sussex (STFC summer school).


B is a computer language designed by D. M. Ritchie and K. L. Thompson, for primarily non-numeric applications such as system programming. These typically involve complex logical decision-making, and processing of integers, characters, and bit strings. On the H6070 TSS system, B programs are usually much easier to write and understand than assembly language programs, and object code efficiency is almost as good. Implementation of simple TSS subsystems is an especially appropriate use for B. This technical report contains a description of the MH-TSS (Honeywell 6070) version of B (by S. C. Johnson), and a tutorial introduction to most of the features of the language (by B. W. Kernighan).
For scholars, the page images are also available:
The document seems to exist only on (partially) original paper printed on a Teletype model 37 terminal. It uses underlining for emphasis. You need to look at the PDF scans to verify any typos I might have introduced in cleaning up the OCR, which was pretty good except where there was underlining or double-quote characters; they tended to merge into the line above. I avoided the urge to redact the original except for a few obvious mistakes, in particular some missing semicolons in the syntax for some of the commands.
When this CSTR was issued, which was probably some months after the papers were written, the use of B was growing on the local Honeywell GCOS system. Its time-sharing facility was called MH-TSS here, and it was then the main computation facility at Bell Labs in Murray Hill, NJ. By this time, use of B in the early Unix system was already pretty much at an end; early C had already taken over (see The Development of the C Language). In fact, by September 1973, the operating system had already been translated into C and most of the B utilities converted.
The memos shown here were based on an earlier document, User's Reference to B, by Ken Thompson. The Unix dialect of B closely followed the Honeywell version described here--the compiler front-ends were the same, but of course the Unix system calls were present, and the GCOS-specific I/O stuff absent. The basic library must have looked very similar.
Indeed, there were never very many B programs on early Unix. The compiler itself was written in B, and a few of the utilities, for example the first /etc/glob, which expanded wild-card characters for the shell. This is because no compiler to machine code for the PDP-7 or PDP-11 was ever built; the Unix B compilers produced interpreted, threaded code that wasn't efficient enough to write a whole system in.
On the other hand, B, with a real compiler, flourished in a modest way on the Honeywell machines, as indicated by this CSTR. Moreover, it had direct use and even progeny elsewhere, especially at the University of Waterloo in Ontario. It apparently lives on today: see Thinkage Ltd. UW Tools Package, for example.
A final note of possible historical interest or amusement: so far as Brian and I can remember, the Tutorial contains the first instance of a "Hello, world" program.
Copyright © 1997 Lucent Technologies Inc. All rights reserved.Last fiddled 29 May 2000, adding PDF distillations of the OCR.


See concerts by the artists you love!
Login with Spotify to see performances scheduled for your top artist.
Login with Spotify to see performances scheduled for your top artist.
Lorem ipsum dolor sit amet consectetur adipisicing elit. Eum corrupti nostrum molestiae, natus architecto voluptas aspernatur a quia fugiat culpa atque, consectetur asperiores libero tempora. Quae deserunt ex quo ullam!


Update Album
Name:
Cover:
Update
Create Track
Name:
Duration:
Lyrics:
Genre ID:
No Genre
Playlist ID:
No Playlist
Create


|
Existenzia
|
Public Attributes | |
| std::string | method |
| std::string | version |
| std::string | host |
| std::string | port |
| std::string | path |
| std::map< std::string, std::string > | query |
| Public Attributes inherited from xzia::Message | |
| std::string | body |
| std::string | version |
| std::map< std::string, std::string > | header |
| Client const | client |
Additional Inherited Members | |
| Public Member Functions inherited from xzia::Message | |
| Message (Client client) | |
| bool | hasBody () const |


One of the key elements of the Cloud App Security framework is protecting your sensitive information. Sensitivity is a subjective phrase, as this can vary from one organization to another.
Here, you’ll understand how to find which apps are accessing your data, how to classify which information is sensitive, how to protect it from illegal access, and how to monitor and report on the overall health of your environment.
An employee might accidentally upload a file to the wrong place. Or they could send confidential information to someone who shouldn’t have it. As a result, information could be lost or made accessible to the wrong person. Any lost or wrongfully exposed information can have serious legal, financial, or reputational consequences for your organization. Information is vital to any modern organization, and you want to ensure that it’s protected at all times.
To help you, Microsoft Cloud App Security natively integrates with Azure Information Protection, a cloud-based service that helps classify and protect files and emails across your organization.
Note
You have to enable the app connector for Microsoft 365 to take advantage of Azure Information Protection
You enforce information protection with Microsoft Cloud App Security through phases:
During this phase, you make sure apps are connected to Microsoft Cloud App Security so it can scan for and classify data, then apply policies and controls. You can do this in two different ways: use an app connector, or use Conditional Access App Control.
In this phase, you’ll do the following:
Decide what counts as sensitive in the context of your organization. Microsoft Cloud App Security includes more than 100 predefined sensitive information types, and default labels in Azure Information Protection. Sensitive information types and labels define how to handle, for example, passport numbers and national identity numbers. You can also use default labels in Azure Information Protection. These labels will be used by Microsoft Cloud App Security when scanning, to classify information. The labels are:
Enable Azure Information Protection integration in Microsoft Cloud App Security by selecting Automatically scan new files for Azure Information Protection classification labels in the Settings pane:
There are different types of policies you can create to detect sensitive information and act accordingly. For example, you can create a File policy to scan the content of files in your apps in real time, and for data at rest. File policies let you apply governance actions. You can then automatically:
To create a file policy
Open Microsoft Cloud App Security
Select the Control pane
Select Policies > Create policy
Select File policy
When the form that appears, you’ll fill in the following fields:
When you’re done, select Create to create your file policy.
Check your dashboard to monitor for alerts and the overall health of your environment. For example, to review file-related alerts, go to the Alerts pane, and select DLP in the Category field.
You can investigate a file-related alert to better understand what caused it to be triggered. Or you can dismiss an alert that you determine could be ignored. You can also export your alerts to a CSV file for further analysis.


| HYTOOL Function Reference |
Produces the final figure and results for the Gringarten & Ramey model
grg_rpt( p, t, s, d, ttle ) p(1) = a = slope of the late time straight line p(2) = t0 t = measured time s = measured drawdown d(1) = Q = Pumping rate d(2) = S = Storage coefficient ttle = Title of the figure Description Produces the final figure and results for Gringarten model (1974).
grg_dmo, grg_dim, grg_gss Published output in the Help browser showdemo grg_rpt
| Hytool |
© 1998-2017 Philppe Renard and Co. Terms of Use Acknowledgments


Golden Beet Borscht, Dressed Red Cabbage, Salmon Roe, Green Onion
Smoked Veal Sausage and Cornichon Stuffing, Dill Spätzle, Onion Gravy
Sautéed Breast, Confit Leg, Hen-of-the-Woods Mushrooms, Caramelized Squash Purée, Spicy Kraut
Crispy Kale, Forest Mushroom Purée, Poached Cranberries, Sherry Reduction
Red Lentil Purée, Duck Speck, Wilted Spinach, Cinnamon Vinaigrette
Piquillo Pepper Soubise, Roasted Oyster Mushrooms, Bread and Butter Shallots, Baby Arugula, Hazelnut Oil
Grilled Vintage Hanger Steak, Rosemary Garlic Fries, Red Wine Shallot Sauce


Anime
Manga
Season
Published
Studio
Author
Score
Score
Rank
Rank
Select All
Select All
Unselect All
Unselect All
Update


HEART AND SOULS A film review by Sally Smith Copyright 1993 Sally Smith
Starring Robert Downey, Jr., Charles Grodin, Kyra Sedgwick, Elisabeth Shue, Tom Sizemore, David Paymer, Alfre Woodard Directed by Ron Underwood Screenplay by Gregory Hansen, Erik Hansen, Brent Maddock, S. S. Wilson Director of Photography Michael Watkins, ASC Rated PG-13 (apparently just for occasional language, not content)
I write this review under much the same conditions as my last: not being overly familiar with the work of anyone working on it except for the cinematographer--but that was enough reason for me to attend.
Thomas Reilly (Downey) is born at the same time a bus crashes, and the souls of the passengers--single working mom Woodard, nebbish opera singer wannabe Grodin, small-time hood (Sizemore) and sweet waitress (Sedgwick)--become attached to him (literally--they can only travel a few yards away). Little Thomas grows up having a wonderful time with his constant companions who are invisible to anyone but him. Unfortunately, by the time he's seven, his family is so worried about the behavior his "imaginary" friends are leading him into that the spirits decide he'd be better off without him, and make themselves completely invisible.
Flash forward about 25 years. Thomas is now a greedy superficial San Francisco yuppie specializing in corporate bankruptcies. The ghosts aren't happy with the way he's running his life (although they do approve of his latest girlfriend, Shue), but stay invisible until they're informed that there was a mixup "upstairs" and that they shouldn't have been here all these years. They were supposed to use Thomas to fulfill the dreams they didn't get to accomplish, and now they only have a few days to do it. Thomas, naturally, is less than thrilled about their reappearance, but is eventually persuaded (humorously) to help them out--hopefully helping himself in the process.
Downey shows off his gift for physical comedy and mimicry in a number of very funny scenes; Grodin is less annoying in this film than in anything else in recent memory; Woodard is the very definition of Mom; Sedgewick, Shue, Sizemore, and Paymer acquit themselves nicely in somewhat under-written roles. The actors playing the ghosts do develop a rapport that reflects the reluctant affection that develops between four total strangers forced to live together for decades.
Special effects range from cheesy to quite attractive, including some infrequent and correctly-used (hallelujah!) morph shots, Mic Rodgers' stunt work is very well-done, the production design for both the Fifties and Nineties is dead on, as is (the always-excellent) Jean-Pierre Dorleac's costume design. The photography again did not disappoint me--it's stylish, lovely, fluid, imaginative (especially in some of the subjective camera shots), and incorporates the many special effects quite naturally and matter-of-factly. However, it does all this without overwhelming the quiet, intimate nature of what is basically a small story about some ordinary people.
HEART AND SOULS is an overwhelmingly charming, sweet, heart-warming, and old-fashioned movie. Cynics should avoid it at all costs. People who want several good laughs, a lot of smiles, and a couple of poignant moments should rush to see it. It's probably the best date movie of the summer. I liked it a lot, I'll see it again, I recommend it.
-- Sally Smith<PHONE_NUMBER><EMAIL_ADDRESS>(I was<EMAIL_ADDRESS>.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Change Your Key
You can change the key you use to access your vessels. After you change your key, it may take a few minutes before you can access all of your vessels with your new key or see them listed when you browse with Seash.
Upload a public key
{% if error_msg %}{{ error_msg }}
{% endif %}
If you have generated a key pair on your own computer (for example, using Seash), you can upload your public key here. Do not upload your private key.


Harsh
Email<EMAIL_ADDRESS>Programming Languages
Frameworks
Design
Version Control
Databases
Deep Learning Frameworks
Other
Projects and Contributions
Handles
LinkedIn


This page allows you to access experiments via the API. Read the documentation here.
Click the authorize button to grant access to your Google Analytics data.
Experiment ID:
Experiment:


Dear {{ user.username }},
Please find attached the archive of your posts that you requested.
Sincerely,
The Microblog Team


Resource Type: vagrant_vm
- Defined in:
- lib/puppet/type/vagrant_vm.rb
- Providers:
-
vagrant_vm
Overview
vagrant_vm a file
Properties
-
box
(defaults to: centos/7)
The vagrant box image to use
Supported values:- /^\S+$/
-
certname
Use this certname instead of the default (fqdn)
Supported values:- /^\S+$/
-
challenge_password
Challenge password to embed in the CSR when requesting access to puppet
Supported values:- /^\S+$/
-
cpu
(defaults to: 1)
vCPUs to allocate to this VM
-
ensure
(defaults to: present)
Create or remove the vagrant_vm
Supported values:- present
- absent
- running
- stopped
-
ip
IP address
-
memory
(defaults to: 512)
Memory to allocate to this VM in MB
-
pp_role
Trusted fact
pp_role
for this nodeSupported values:- /^\S+$/
-
provision
(defaults to: 1)
Provision script to run after booting VM (and installing puppet if requested)
-
puppet_master_fqdn
fqdn of puppet master to connect this VM to
Supported values:- /^\S+$/
-
puppet_master_ip
IP address of puppet master if not in DNS
Supported values:- /^\S+$/
Parameters
-
name (namevar)
Name of this VM instance
-
synced_folder
Array of synced folders to use
-
user
(defaults to: vagrant)
User to run VM as


Tooltip text.
Rust standard library
Search:
The Book
Keywords
Primitives
alloc
core
proc_macro
std
test
since
1.0.0
Description
Summary
Methods
Source
Description
Items:
Declaration:
Implementations:
Methods:


Lorem ipsum dolor sit amet, consectetur adipisicing elit. Ea voluptas, excepturi ipsum reiciendis, saepe dolor tenetur
accusantium cumque optio distinctio iste est corporis quibusdam ut neque expedita. Nulla, voluptatem, dignissimos!Lorem
ipsum dolor sit amet, consectetur adipisicing elit. Minus asperiores, ad, placeat dolorem nesciunt animi optio odio
blanditiis, quo sed eius neque velit cum accusamus quia? Non voluptatibus eius nesciunt.Lorem ipsum dolor sit amet,
consectetur adipisicing elit. Repellendus praesentium voluptas, tempora explicabo temporibus! Quos adipisci fugiat
natus tempore minima, quo nostrum architecto provident id nulla quam corporis aliquid ex?
How two iconic brands teamed up to attract a modern young audience
Coca Cola and Regal Entertainment Group were looking for a story that would appeal to today's younger and more diverse audiences.
We opted to focus on a red carpet experience that any teenager in the age of social media can relate to and positioned our clients' brands as key to that experience.
Our work was featured before every movie on over 8000 Regal Cinema locations across the country and seen by millions of moviegoers.


About: Last Trail by Stan Williams This song was recorded at Mira Vista Studios June 7th 2007.Music composed by Stan Williams www.stanwilliamsmusic.com. This audio is part of the collection: Community Audio. Artist/Composer: Stan J. Williams BMI Date: 2007-06-07
scroll down


Q1. What is the meaning of maglia in Italian Language jersey fax magnet post card Q2. what is the meaning of festa in italian language weekday public holiday/party birthday festival Q3. What is the meaning of alto in Italian Language small auto low wide Q4. What is the meaning of non alcuno in Italian Language anyone something nothing notebook Q5. What is the meaning of maschera in Italian Language hot water machete mask matches Q6. What is the meaning of esame in Italian Language exam same script shame Q7. What is the meaning of concerto in Italian Language concert concern grape camera Q8. What is the meaning of pui in Italian Language push put more why Q9. What is the meaning of ancora in Italian Language anaconda anchor not yet already Q10. What is the meaning of fidanzato in Italian Language spoon bowl friend fiddle Q11. What is the meaning of lettore in Italian Language family letter lawyer reader Q12. What is the meaning of specttacolo in Italian Language spectacular special cafe show Q13. What is the meaning of lago in Italian Language lack lake lagoon logo Q14. What is the meaning of vaso in Italian Language vas pot vest video Q15. What is the meaning of mappa in Italian Language map male passport mob Q16. What is the meaning of panchina in Italian Language pillow bench game slate Q17. What is the meaning of spacioso in Italian Language space narrow tight wide Q18. What is the meaning of letto in Italian Language letter litter lotto bed Q19. What is the meaning of storia in Italian Language history literature book story Q20. What is the meaning of nonno in Italian Language sister brother grandmother grandfather


IFM
About us
Our Services
Contact us
Our Gallery
IFM Glass & Aluminium Pty(Ltd)
About us
Our Services
Contact
Our Gallery
menu
Contact Form
Please fill in the form below:
account_circle
First Name
phone
Telephone
email
Email
mode_edit
Message
Browser Select
Choose your option
Service Enquiry
Complaint
Recommendation
Submit
send


|
TicTacToe
|
Slot of the tic tac toe grid. More...
Public Attributes | |
| bool | IsFree => !Symbol.Value |
| Is slot free ? More... | |
Properties | |
| ReactiveProperty< Symbol > | Symbol [get, private set] |
| Symbol attached to this slot More... | |
| ReactiveCommand | PlaceSymbol [get, private set] |
| Place symbol command More... | |
Private Member Functions | |
| void | Awake () |
| void | SetSymbol (Symbol symbol) |
| Set the symbol on the slot More... | |
| void | ClickSlot () |
| Click the slot More... | |
Private Attributes | |
| EventTrigger | eventTrigger |
| event trigger to handle click More... | |
| AudioSource | audioSource |
| audio source to play place sound More... | |
| AudioClip | circle |
| sound for circle symbol More... | |
| AudioClip | cross |
| sound for cross symbol More... | |
Slot of the tic tac toe grid.
|
private |
|
private |
Click the slot
|
private |
Set the symbol on the slot
| symbol | symbol to set on the slot |
|
private |
audio source to play place sound
|
private |
sound for circle symbol
|
private |
sound for cross symbol
|
private |
event trigger to handle click
| bool TicTacToe.GridSlot.IsFree => !Symbol.Value |
Is slot free ?
|
getprivate set |
Place symbol command


City boss Guardiola accuses Liverpool star Mane of diving
Manchester - Pep Guardiola has accused Liverpool star Sadio Mane of diving as the Manchester City boss lit the fuse on next weekend's explosive clash between the Premier League title rivals.
Mane scored Liverpool's winner in the fourth minute of stoppage-time as the leaders scored twice in the final moments to escape with a 2-1 victory at Aston Villa on Saturday.
But the Senegal winger had been booked for simulation in the first half at Villa Park and that didn't escape Guardiola's attention.
Asked about Liverpool's comeback, Guardiola, speaking after City came from behind to beat Southampton 2-1, told BBC Sport: "It has happened many times, what Liverpool have done, in the last few years, it's because (Mane) is a special talent.
"Sometimes he's diving, sometimes he has this talent to score incredible goals in the last minute. He's a talent."
Liverpool remain six points clear of City ahead of their crucial showdown at Anfield on Sunday and Guardiola knows the European champions will be tough to catch given their relentless drive.
"If it's one time, two times, 'we were lucky, we were lucky', but it happened in the last two seasons many, many times. They have a special character to do that," Guardiola said.
"We look at ourselves, we know which team we face, I think they have won 10 and drawn one. Next week we go to Anfield to try to play them."


Crotalaria cobalitcola, or ‘fleur du cobalt’, is used to identify cobalt rich soils. Some other cobalt-tolerant plants will either succumb to cobalt toxicity at high concentrations or can also be found in areas without cobalt. This crotalaria fulfills both tests – it can tolerate high cobalt and does not grow in areas without it – so it is useful for deciding where to dig.


Flatdoc is a small JavaScript file that fetches Markdown files and renders them
as full pages. Essentially, it’s the easiest
way to make open source documentation from Readme files.
Current version: v/0.8.6
Create a file based on the template, which has a bare DOM, link to the
scripts, and a link to a theme. It will look something like this (not exact).
For GitHub projects, simply place this file in your GitHub pages branch and
you’re all good to go.
In short: just download this file and upload it somewhere.
The main JS and CSS files are also available in npm and bower.

<link href='https://cdn.rawgit.com/rstacruz/flatdoc/v0.9.0/theme-white/style.css' rel='stylesheet'>

To fetch a Github Repository’s readme file, use the Flatdoc.github
fetcher.
This will fetch the Readme file of the repository’s default branch.
Flatdoc.run({
fetcher: Flatdoc.github('USER/REPO')
});
You may also fetch another file other than the Readme file, just specify it as
the 2nd parameter.
Flatdoc.run({
fetcher: Flatdoc.github('USER/REPO', 'Changelog.md')
});
After you’ve done this, you probably want to deploy it via GitHub Pages.
You may also fetch a file. In this example, this fetches the file Readme.md
in
the same folder as the HTML file.
Flatdoc.run({
fetcher: Flatdoc.file('Readme.md')
});
You may actually supply any URL here. It will be fetched via AJAX. This is
useful for local testing.
Flatdoc.run({
fetcher: Flatdoc.file('http://yoursite.com/Readme.md')
});
Flatdoc is a hosted .js
file (along with a theme and its assets) that you can
add into any page hosted anywhere.
There are no build scripts or 3rd-party services involved. Everything is done in
the browser. Worried about performance? Oh, It’s pretty fast.
Flatdoc utilizes the GitHub API to fetch your project’s Readme files. You may
also configure it to fetch any arbitrary URL via AJAX.
Next, it uses marked, an extremely fast Markdown parser that has support for
GitHub flavored Markdown.
Flatdoc then simply renders menu and content DOM elements to your HTML
document. Flatdoc also comes with a default theme to style your page for you, or
you may opt to create your own styles.
Flatdoc offers a few harmless, unobtrusive extras that come in handy in building
documentation sites.
You can use Markdown code fences to make syntax-highlighted text. Simply
surround your text with three backticks. This works in GitHub as well.
See GitHub Syntax Highlighting for more info.
``` html
<strong>Hola, mundo</strong>
```
Blockquotes show up as side figures. This is useful for providing side
information or non-code examples.
Blockquotes are blocks that begin with
>
.
Single quotes, double quotes, and double-hyphens are automatically replaced to
their typographically-accurate equivalent. This, of course, does not apply to
and

blocks to leave code alone.
“From a certain point onward there is no longer any turning back. That is the
point that must be reached.”
—Franz Kafka
If your link text has a >
at the end (for instance: Continue >
), they show
up as buttons.
For the default theme (theme-white), You can set theme options by adding
classes to the
element. The available options are:
Makes 3rd-level headings bigger.

Disables “literate” mode, where code appears on the right and content text
appear on the left.

Makes the opening paragraph large.

You have full control over the HTML file, just add markup wherever you see fit.
As long as you leave role='flatdoc-content'
and role='flatdoc-menu'
empty as
they are, you’ll be fine.
Here are some ideas to get you started.
#acknowledgements + p
).Flatdoc emits the events flatdoc:loading
and flatdoc:ready
to help you make
custom behavior when the document loads.
$(document).on('flatdoc:ready', function() {
// I don't like this section to appear
$("#acknowledgements").remove();
});
You don’t have to be restricted to the given theme. Flatdoc is just really one.js
file that expects 2 HTML elements (for menu and content). Start with
the blank template and customize as you see fit.

The following projects have inspired Flatdoc.
Backbone.js - Jeremy’s projects have always adopted this “one page
documentation” approach which I really love.
Docco - Jeremy’s Docco introduced me to the world of literate programming,
and side-by-side documentation in general.
Stripe - Flatdoc took inspiration on the look of their API documentation.
DocumentUp - This service has the same idea but does a hosted readme
parsing approach.
Photo taken from Flickr,
licensed under Creative Commons.
© 2013, 2014, Rico Sta. Cruz. Released under the MIT
License.
Flatdoc is authored and maintained by Rico Sta. Cruz with help from its
contributors.