- Turing supports models with discrete parameters and stochastic control flow.
+
+
+
+ Intuitive
+
+ Turing models are easy to write and communicate — syntax is close to mathematical notations.
+
+
+
+ General-purpose
+
+ Turing supports models with discrete parameters and stochastic control flow.
+
+
+
+ Modular & composable
+
+ Turing is modular, written entirely in Julia, and is interoperable with the powerful Julia ecosystem.
+
-
-
-
Modular & composable
- Turing is modular, written entirely in Julia, and is interoperable with the powerful Julia ecosystem.
+
+```
+
+
+
+
+ Hello, World in Turing
+ Some text about how easy it is to [get going](https://turinglang.org/docs/tutorials/00-introduction/).
+
+
+```julia
+@model function coinflip(; N::Int)
+ # Prior belief about the probability of heads
+ p ~ Beta(1, 1)
+
+ # Heads or tails of a coin are drawn from `N`
+ # Bernoulli distributions with success rate `p`
+ y ~ filldist(Bernoulli(p), N)
+
+ return y
+end;
+```
+
+
+
+```julia
+@model function putting_model(d, n; jitter=1e-4)
+ v ~ Gamma(2, 1)
+ l ~ Gamma(4, 1)
+ f = GP(v * with_lengthscale(SEKernel(), l))
+ f_latent ~ f(d, jitter)
+ binomials = Binomial.(n, logistic.(f_latent))
+ y ~ product_distribution(binomials)
+ return (fx=f(d, jitter), f_latent=f_latent, y=y)
+end
+```
+
+
+
+ Goodbye, World in Turing
+
+ Some text about how easy it is to interface with external packages like AbstractGPs. Learn more about modelling [Gaussian Processes](https://turinglang.org/docs/tutorials/15-gaussian-processes/) with Turing.jl.
+
```
+
+::: {.section-start-space}
+
+### Algorithms
+
+Placeholder text introducing this section on algorithms.
+
+| Column 1 | Column 2 | Column 3 | Column 4 |
+|----------|----------|----------|----------|
+| Entry A | Entry D | Entry G | Entry J |
+| Entry B | Entry E | Entry H | Entry K |
+| Entry C | Entry F | Entry I | Entry L |
+
+: Supported MCMC and other learning algorithms {.striped .borderless}
+
+:::
+
+::: {.section-start-space}
+
+### Bayesian Workflow
+
+Placeholder text introducing the Bayesian Workflow diagram from the ACM special issue submission.
+
+```{=html}
+
+
+
An example of the Beeysian workflow.
+
+```
+
+:::
+
+```{=html}
+
+
+
Talks
+
Placeholder for intro text on list of talks which are available online
+
+
Talk 1
+
Talk 2
+
Talk 3
+
+
+
+
Inofficial tutorials
+
Placeholder for intro text on list of inofficial tutorials
- Turing models are easy to write and communicate — syntax is close to mathematical notations.
+ Turing models are easy to write and communicate — their syntax closely resembles mathematical notation.
@@ -74,9 +74,9 @@ description: |
- Modular & composable
+ Composable
- Turing is modular, written entirely in Julia, and is interoperable with the powerful Julia ecosystem.
+ Turing is written entirely in Julia, and is interoperable with its powerful ecosystem.
```
@@ -98,7 +98,6 @@ description: |
# Bernoulli distributions with success rate `p`
y ~ filldist(Bernoulli(p), N)
- return y
end;
```
@@ -146,7 +145,7 @@ end
Ecosystem
- Learn about all the packages that are part of The Turing Organization.
+ Learn about all the packages that are part of the TuringLang organization.
- Learn to tackle specific problems with Turing.jl.
+ Learn to tackle specific modelling problems with Turing.jl.
@@ -211,12 +210,12 @@ Placeholder text introducing the Bayesian Workflow diagram from the ACM special
-
Inofficial tutorials
-
Placeholder for intro text on list of inofficial tutorials
+
Other resources
+
This list contains a few other written resources for learning Turing. If you have written something and would like to share it with the community, please get in touch!
+```
\ No newline at end of file
diff --git a/index.qmd b/index.qmd
index 40a7a5b17..9f1700882 100644
--- a/index.qmd
+++ b/index.qmd
@@ -20,77 +20,39 @@ description: |
Turing.jl is a probabilistic programming language and Bayesian modelling framework for the Julia programming language.
---
-```{=html}
-
-
-
Turing.jl
-
-
-
-
-
-```
+{{< include _includes/header.qmd >}}
-```{=html}
-
- Bayesian inference with probabilistic programming
-
-
- Turing models are easy to write and communicate — their syntax closely resembles mathematical notation.
-
-
-
- General-purpose
-
- Turing supports models with discrete parameters and stochastic control flow.
-
-
-
- Composable
-
- Turing is written entirely in Julia, and is interoperable with its powerful ecosystem.
-
-
-```
+::: {.panel}
+##### Expressive {.panel-title .pb-1}
+Turing models are easy to write and communicate — their syntax closely resembles mathematical notation.
+:::
-
-
-
- Hello, World in Turing
-
- Some text about how easy it is to [get going](https://turinglang.org/docs/tutorials/00-introduction/).
-
-
+::: {.panel}
+##### General-purpose {.panel-title .pb-1}
+Turing supports models with discrete parameters and stochastic control flow.
+:::
+
+::: {.panel}
+##### Composable {.panel-title .pb-1}
+Turing is written entirely in Julia, and is interoperable with its powerful ecosystem.
+:::
+
+:::::
+
+
+::::: {.d-flex .flex-row .flex-wrap .panel-wrapper .gap-3 .pb-2}
+
+::: {.example-text style="text-align:right;padding:0.5rem;"}
+
+
Hello, World in Turing
+
+Some text about how easy it is to [get going](https://turinglang.org/docs/tutorials/00-introduction/).
+
+:::
+
+::: {.example-code}
```julia
@model function coinflip(; N::Int)
# Prior belief about the probability of heads
@@ -102,16 +64,21 @@ description: |
end;
```
-
-
-
-
-
- Goodbye, World in Turing
-
- Some text about how easy it is to interface with external packages like AbstractGPs. Learn more about modelling [Gaussian Processes](https://turinglang.org/docs/tutorials/15-gaussian-processes/) with Turing.jl.
-
+
+Some text about how easy it is to interface with external packages like AbstractGPs. Learn more about modelling [Gaussian Processes](https://turinglang.org/docs/tutorials/15-gaussian-processes/) with Turing.jl.
+
+:::
+
+::: {.example-code}
```julia
@model function putting_model(d, n; jitter=1e-4)
v ~ Gamma(2, 1)
@@ -123,14 +90,12 @@ end;
return (fx=f(d, jitter), f_latent=f_latent, y=y)
end
```
-