Theoretical Computer Science
Andrew Polonsky's user avatar
Andrew Polonsky's user avatar
Andrew Polonsky's user avatar
Andrew Polonsky
  • Member for 6 years, 8 months
  • Last seen more than a month ago
  • Amsterdam, Netherlands
Profile Activity
Stats
611
reputation
2k
reached
3
answers
1
question
Communities
View all
About

I am a postdoc in computer science at VU Amsterdam. I work in lambda calculus and type theory.

Badges
View all badges
This user doesn’t have any gold badges yet.
6
silver badges
10
bronze badges
Top tags
View all tags
14
Score
3
Posts
75
Posts %
10
Score
1
Posts
25
Posts %
9
Score
1
Posts
25
Posts %
5
Score
1
Posts
25
Posts %
0
Score
1
Posts
25
Posts %
0
Score
1
Posts
25
Posts %
Top posts
All Questions Answers
Score Newest
answer
10
What else (besides the usual) can be said about a Scott Information System if the constructed domain is required to be Hausdorff?
Apr 12, 2017
answer
9
How can non-terminating $\lambda$-terms be turned into fixed-point combinators?
Mar 18, 2017
answer
5
How to state the adequacy of an encoding of lambda calculus in itself?
Mar 18, 2017
question
4
Finite intersection property of polymorphic type families
Jul 5, 2017
Top network posts
View all network posts
16
Are there any natural theories T for which P=NP implies T proves P=NP?
8
Is every total computable function definable by a normalizing lambda term?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.