鉴于这种情况下中间结果: open import IO
open import Data.String
open import Data.Unit
open import Coinduction
postulate
A : Set
f : String → A
g₁ g₂ : A → String
比方说,我想let实现类似 foo : IO ⊤
fo
我试图编写一个Coq函数,它需要一个Stream和一个谓词并返回,作为list,该属性拥有的流的最长前缀。这是我有: Require Import List Streams.
Require Import Lt.
Import ListNotations.
Local Open Scope list_scope.
Section TakeWhile.
Context {A : Ty
我使用: $ coqtop -v
The Coq Proof Assistant, version 8.4pl5 (February 2015)
compiled on Feb 06 2015 17:44:41 with OCaml 4.02.1
予定义的下列CoInductive类型,stream: $ coqtop
Welcome to Coq 8.4pl5 (February 20