Pages that link to "Item:Q1249567"
From MaRDI portal
The following pages link to Fully abstract models of typed \(\lambda\)-calculi (Q1249567):
Displayed 17 items.
- (Q3662598) (← links)
- (Q3912568) (← links)
- Functions as processes (Q4017458) (← links)
- (Q4222750) (← links)
- Fully abstract translations between functional languages (Q4286526) (← links)
- (Q4499206) (← links)
- (Q4513578) (← links)
- Symmetry and Interactivity in Programming (Q4650295) (← links)
- Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages (Q4728280) (← links)
- Note on Algol and conservatively extending functional programming (Q4880529) (← links)
- On the ubiquity of certain total type structures (Q5430138) (← links)
- On Natural Non-dcpo Domains (Q5452201) (← links)
- Computing with Functionals—Computability Theory or Computer Science? (Q5479568) (← links)
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators (Q5958469) (← links)
- A typed context calculus (Q5958759) (← links)
- Finitary PCF is not decidable (Q5958762) (← links)
- On the expressive power of first-order boolean functions in PCF (Q5958769) (← links)