last exercise of Chapter 3 ..

Give a recursive definition for FTV(A), the set of free type variables in A,
for an expression A in T2 or in ΛT2.

I can get my head around the definition for FV in untyped λ-terms but now I have to think about what T2 or in ΛT2 really means for free variables...

my head hurts!

#maths #cs

📰 "State Space Models Naturally Produce Traveling Waves, Time Cells, and Scale to Abstract Cognitive Functions"
https://arxiv.org/abs/2507.13638 #Q-Bio.Nc #Dynamics #Matrix #Cs.Lg
State Space Models Naturally Produce Traveling Waves, Time Cells, and Scale to Abstract Cognitive Functions

A grand challenge in modern neuroscience is to bridge the gap between the detailed mapping of microscale neural circuits and a mechanistic understanding of cognitive functions. While extensive knowledge exists about neuronal connectivity and biophysics, a significant gap remains in how these elements combine to produce flexible, learned behaviors. Here, we propose that a framework based on State-Space Models (SSMs), an emerging class of deep learning architectures, can bridge this gap. We argue that the differential equations governing elements in an SSM are conceptually consistent with the biophysical dynamics of neurons, while the combined dynamics in the model lead to emergent behaviors observed in experimental neuroscience. We test this framework by training an S5 model--a specific SSM variant employing a diagonal state transition matrix--on temporal discrimination tasks with reinforcement learning (RL). We demonstrate that the model spontaneously develops neural representations that strikingly mimic biological 'time cells'. We reveal that these cells emerge from a simple generative principle: learned rotational dynamics of hidden state vectors in the complex plane. This single mechanism unifies the emergence of time cells, ramping activity, and oscillations/traveling waves observed in numerous experiments. Furthermore, we show that this rotational dynamics generalizes beyond interval discriminative tasks to abstract event-counting tasks that were considered foundational for performing complex cognitive tasks. Our findings position SSMs as a compelling framework that connects single-neuron dynamics to cognitive phenomena, offering a unifying and computationally tractable theoretical ground for temporal learning in the brain.

arXiv.org
https://www.walknews.com/984334/ 海に浮かぶ巨大ウォーターパークが 和歌山の美ビーチに出現!子どもも大人も「海上の冒険エリア」を遊び尽くそう! | 鉄道ニュース | 鉄道チャンネル #546 #Ch546 #CS #Wakayama #スカパー #チャンネル #前面展望 #和歌山 #和歌山県 #海に浮かぶ巨大ウォーターパークが和歌山の美ビーチに出現!子どもも大人も「海上の冒険エリア」を遊び尽くそう! #鉄道 #鉄道コラム #鉄道チャンネル #鉄道ニュース #電車
https://www.wacoca.com/news/2589993/ 隅田川花火大会7/26(土)開催!最寄り駅や観覧場所、穴場スポット、重要なお知らせ等を完全ガイド!2万発の花火が東京の夜空を彩る | 鉄道ニュース | 鉄道チャンネル #546 #Ch546 #CS #Tokyo #スカパー #チャンネル #前面展望 #東京 #東京都 #鉄道 #鉄道コラム #鉄道チャンネル #鉄道ニュース #隅田川花火大会7/26(土)開催!最寄り駅や観覧場所、穴場スポット、重要なお知らせ等を完全ガイド!2万発の花火が東京の夜空を彩る #電車

I'd welcome feedback on my attempt to do ex 3.18 from Type Theory & Formal Proof

This one defines a binary tree represented by a λ2-term, and asks us to find a λ2 which combines two such trees.

https://cs.stackexchange.com/questions/173268/feedback-on-λ2-calculus-exercise-combining-binary-trees

ps - this isn't school homework - I'm self-teaching with no mentor/teacher so I have to ask online for advice/help

#maths #cs

Exercise in book asks me prove that

If Γ ⊢ L : ρ then Γ is a λ2-context.

I'm pondering what the proof strategy should be.

Structural induction on Γ ?
Proof by contradiction ?
...

#maths #cs

I do enjoy creating pictures as I write up my solutions to lambda calculus exercises!

These are binary trees representing λ-terms.

#maths #cs

I think I've got it.

The values of the nodes are Bool.

Bool is not a decider of leaf vs subtree.

And u defines a leaf, v a node from which two subtrees emerge.

Is it me or is the exercise unclear?

#maths #cs

Help !

---

How does a λ2 type like the following represent a binary tree?

Tree ≡ Πα:*.(Bool→α)→(Bool→α→α→α)→α

---

I'm supposed to draw trees for given examples of M:α where

λα:*.λu:Bool→α.λv:Bool→α→α→α.M has type Tree, because M:α.

The first example is M≡u False.

---

I'm staring at the definition of Tree and my brain just can't see how it can be a binary tree. I'm trying to see how the Boolean variable decides whether a node branches or not but still can't see it.

#maths #cs

Trying to work out a λ2 version of "isZero" for Church numerals.

Could be worse places to do these exercises!

#maths #cs #typetheory